Author of the publication

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.

, , and . Discret. Appl. Math., 159 (17): 1996-2029 (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 complexity of the selective graph coloring problem in some special classes of graphs., , , and . Theor. Comput. Sci., (2014)Classifying k-edge colouring for H-free graphs., , , and . Inf. Process. Lett., (2019)On Split B_1 B 1 -EPG Graphs., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 361-375. Springer, (2018)On Contact Graphs of Paths on a Grid., , , and . GD, volume 11282 of Lecture Notes in Computer Science, page 317-330. Springer, (2018)Reducing the Domination Number of Graphs via Edge Contractions., , and . MFCS, volume 138 of LIPIcs, page 41:1-41:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius., , and . MFCS, volume 272 of LIPIcs, page 64:1-64:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Classifying k-Edge Colouring for H-free Graphs., , , and . CoRR, (2018)Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width., , and . CoRR, (2018)Colouring Vertices of Triangle-Free Graphs., , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 184-195. (2010)Upper Domination: towards a dichotomy through boundary properties., , , , , and . CoRR, (2016)