Author of the publication

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.

, , , and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 55-58. (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3., , , and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 55-58. (2013)Maximum Cuts in Edge-colored Graphs., , , , and . Electron. Notes Discret. Math., (2017)2K2 vertex-set partition into nonempty parts., , , , , and . Discret. Math., 310 (6-7): 1259-1264 (2010)On the forbidden induced subgraph probe and sandwich problems., , , and . Discret. Appl. Math., (2018)On the (parameterized) complexity of recognizing well-covered (r, l)-graphs., , , , , and . CoRR, (2017)Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques., , , and . Discret. Appl. Math., 159 (4): 165-173 (2011)On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs., , , , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 423-437. Springer, (2016)On the Oriented Chromatic Number of Union of Graphs., , , and . CTW, page 88-91. (2012)A representation for the modular-pairs of a cograph by modular decomposition., , and . Electron. Notes Discret. Math., (2004)Odd Cycle Transversals and Independent Sets in Fullerene Graphs., , and . SIAM J. Discret. Math., 26 (3): 1458-1469 (2012)