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⟩