Bi-arc graphs and the complexity of list homomorphisms

@article{Feder2003BiarcGA,
  title={Bi-arc graphs and the complexity of list homomorphisms},
  author={Tom{\'a}s Feder and Pavol Hell and Jing Huang},
  journal={Journal of Graph Theory},
  year={2003},
  volume={42},
  pages={61-80}
}
Given graphs G;H, and lists LðvÞ V ðHÞ; v 2 V ðGÞ, a list homomorphism of G to H with respect to the lists L is a mapping f : V ðGÞ ! V ðHÞ such that uv 2 EðGÞ implies f ðuÞf ðvÞ 2 EðHÞ, and f ðvÞ 2 LðvÞ for all v 2 V ðGÞ. The list homomorphism problem for a fixed graph H asks whether or not an input graph G, together with lists 

From This Paper

Figures and tables from this paper.
77 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Bi-arc graphs and the complexity of list homomorphisms

  • T. Feder, P. Hell, J. Huang
  • Preprint
  • 2001
Highly Influential
5 Excerpts

Boland

  • C. G. Lekkerkerker, J. Ch
  • Representation of a finite graph by a set of…
  • 1962
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…