The complexity of the list homomorphism problem for graphs.

Egri, L.; Krokhin, A.; Larose, B.; Tesson, P.

doi:10.4230/lipics.stacs.2010.2467

The complexity of the list homomorphism problem for graphs.

Egri, L.; Krokhin, A.; Larose, B.; Tesson, P.

Authors

L. Egri

Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor

B. Larose

P. Tesson

Contributors

J. -Y. Marion
Editor

T. Schwentick
Editor

Citation

Egri, L., Krokhin, A., Larose, B., & Tesson, P. (2010, December). The complexity of the list homomorphism problem for graphs. Presented at Symposium on Theoretical Aspects of Computer Science., Nancy, France

Presentation Conference Type	Conference Paper (published)
Conference Name	Symposium on Theoretical Aspects of Computer Science.
Publication Date	2010
Deposit Date	Oct 5, 2010
Volume	5
Pages	335-346
Series Title	LIPIcs
DOI	https://doi.org/10.4230/lipics.stacs.2010.2467
Public URL	https://durham-repository.worktribe.com/output/1159351
Publisher URL	http://drops.dagstuhl.de/opus/volltexte/2010/2467/