10.4230/LIPICS.STACS.2010.2467
Egri, László
László
Egri
Krokhin, Andrei
Andrei
Krokhin
Larose, Benoit
Benoit
Larose
Tesson, Pascal
Pascal
Tesson
The Complexity of the List Homomorphism Problem for Graphs
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2010
Article
Graph homomorphism
constraint satisfaction problem
complexity
universal algebra
Datalog
Marion, Jean-Yves
Jean-Yves
Marion
Schwentick, Thomas
Thomas
Schwentick
2010
2010-03-09
2010-03-09
2010-03-09
en
urn:nbn:de:0030-drops-24675
10.4230/LIPIcs.STACS.2010
978-3-939897-16-3
1868-8969
10.4230/LIPIcs.STACS.2010
LIPIcs, Volume 5, STACS 2010
27th International Symposium on Theoretical Aspects of Computer Science
2013
5
30
335
346
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Marion, Jean-Yves
Jean-Yves
Marion
Schwentick, Thomas
Thomas
Schwentick
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2010
5
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
12 pages
312935 bytes
application/pdf
Creative Commons Attribution-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
LIPIcs, Vol. 5, 27th International Symposium on Theoretical Aspects of Computer Science, pages 335-346