Author of the publication

Choosability of P5-Free Graphs.

, and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 382-391. Springer, (2009)

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

Editing to a connected graph of given degrees.. Inf. Comput., (2017)Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , and . Discret. Appl. Math., (2019)Modification to Planarity is Fixed Parameter Tractable., , and . STACS, volume 126 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)Parameterized Aspects of Strong Subgraph Closure., , , , and . Algorithmica, 82 (7): 2006-2038 (2020)Lift Contractions., , , and . Electron. Notes Discret. Math., (2011)A linear kernel for finding square roots of almost planar graphs., , , and . Theor. Comput. Sci., (2017)Induced Disjoint Paths in AT-Free Graphs., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 153-164. Springer, (2012)