Author of the publication

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.

, , and . CoRR, (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

The tessellation problem of quantum walks., , , , , , , and . CoRR, (2017)Kinetic hanger., , and . Inf. Process. Lett., 89 (3): 151-157 (2004)Split Clique Graph Complexity., , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 11-22. Springer, (2011)Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs., , , and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 82-92. Springer, (2012)On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs., , , and . Electron. Notes Discret. Math., (2008)Linear-time Algorithms for Maximum Sets of Sources and sinks., , , and . Electron. Notes Discret. Math., (1999)2K2 vertex-set partition into nonempty parts., , , , and . Electron. Notes Discret. Math., (2008)The perfection and recognition of bull-reducible Berge graphs., , , and . RAIRO Theor. Informatics Appl., 39 (1): 145-160 (2005)Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 13-23. Springer, (2014)An Improved Upper Bound on the Crossing Number of the Hypercube., , , and . WG, volume 2880 of Lecture Notes in Computer Science, page 230-236. Springer, (2003)