The complexity of the list homomorphism problem for graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

The complexity of the list homomorphism problem for graphs

László Egri
  • Function : Correspondent author
  • PersonId : 867105

Connectez-vous pour contacter l'auteur
Andrei Krokhin
  • Function : Author
  • PersonId : 867106
Benoit Larose
  • Function : Author
  • PersonId : 867107
Pascal Tesson
  • Function : Author
  • PersonId : 867108


We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H 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.
Fichier principal
Vignette du fichier
egri.pdf (215.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455321 , version 1 (10-02-2010)


  • HAL Id : inria-00455321 , version 1


László Egri, Andrei Krokhin, Benoit Larose, Pascal Tesson. The complexity of the list homomorphism problem for graphs. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.335-346. ⟨inria-00455321⟩


69 View
309 Download


Gmail Facebook X LinkedIn More