Author of the publication

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles.

, , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 367-380. Springer, (2021)

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

Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , and . CoRR, (2018)Induced Packing of Odd Cycles in a Planar Graph., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 514-523. Springer, (2009)Kempe Equivalence of Colourings of Cubic Graphs., , and . CoRR, (2015)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)Knocking Out P k -free Graphs., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 396-407. Springer, (2014)Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 340-351. Springer, (2005)Finding a Small Number of Colourful Components., , , , , and . CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Graph Editing to a Fixed Target., , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 192-205. Springer, (2013)Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , and . Discuss. Math. Graph Theory, 29 (1): 143-162 (2009)Model Counting for CNF Formulas of Bounded Modular Treewidth., , and . Algorithmica, 76 (1): 168-194 (2016)