Document Open Access Logo

The Complexity of the List Homomorphism Problem for Graphs

Authors László Egri, Andrei Krokhin, Benoit Larose, Pascal Tesson

Thumbnail PDF


  • Filesize: 305 kB
  • 12 pages

Document Identifiers

Author Details

László Egri
Andrei Krokhin
Benoit Larose
Pascal Tesson

Cite AsGet BibTex

László Egri, Andrei Krokhin, Benoit Larose, and Pascal Tesson. The Complexity of the List Homomorphism Problem for Graphs. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 335-346, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)


We completely classify the computational complexity of the list $\bH$-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph $\bH$ the problem is either NP-complete, NL-complete, L-complete or is first-order definable; descriptive complexity equivalents are given as well via Datalog and its fragments. Our algebraic characterisations match important conjectures in the study of constraint satisfaction problems.
  • Graph homomorphism
  • constraint satisfaction problem
  • complexity
  • universal algebra
  • Datalog


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail