Author of the publication

Split Clique Graph Complexity.

, , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 11-22. Springer, (2011)

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

On the structure of bull-free perfect graphs., , and . Graphs Comb., 13 (1): 31-55 (1997)The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube., , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 249-260. Springer, (2013)On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time., , , and . BSB, volume 8213 of Lecture Notes in Computer Science, page 126-135. Springer, (2013)The cost of perfection for matchings in graphs., , , and . Discret. Appl. Math., (2016)A characterization of P4-comparability graphs., , and . Discret. Math., 306 (19-20): 2461-2472 (2006)The total chromatic number of split-indifference graphs., , , and . Discret. Math., 312 (17): 2690-2693 (2012)On the computational difficulty of the terminal connection problem., , and . RAIRO Theor. Informatics Appl., (2023)On the Generation of Bicliques of a Graph., , and . CTW, page 109-113. (2004)Linear-Time Approximation Algorithms for Unit Disk Graphs., , and . WAOA, volume 8952 of Lecture Notes in Computer Science, page 132-143. Springer, (2014)Pebbling in Kneser Graphs., , , , , and . LATIN (2), volume 14579 of Lecture Notes in Computer Science, page 46-60. Springer, (2024)