List homomorphisms of graphs with bounded degrees

Discrete Mathematics

Volumn 307, Issue 3-5, 2007, Pages 386-392

  Feder, Tomás ^c   Hell, Pavol ^a   Huang, Jing ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

^c NONE

Author keywords

Bi arc graph; Bounded degree; Edge asteroid; Extension problem; H colouring problem; Homomorphism; List homomorphism; NP complete problem; Polynomial time algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BI-ARC GRAPH; BOUNDED DEGREE; EDGE-ASTEROID; H-COLOURING PROBLEM; LIST HOMOMORPHISM; NP-COMPLETE PROBLEM; POLYNOMIAL-TIME ALGORITHM;

GRAPH THEORY;

EID: 33845628201     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.09.030     Document Type: Article

References (18)

1. Albertson M.O., and Moore E.H. Extending graph colourings. J. Combin. Theory B 77 (1999) 83-95
2. Brightwell G.R., and Winkler P. Graph homomorphisms and phase transitions. J. Combin. Theory B 77 (1999) 221-262
3. Brooks R.L. On coloring of nodes of a network. Proc. Cambridge Phil. Soc. 37 (1941) 194-197
4. Diaz J., Serna M., and Thilikos D.M. Recent results on parametrized H-colourings. In: Nešetřil J., and Winkler P. (Eds). Graphs, Morphisms and Statistical Physics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 63 (2004) 65-85
5. Dyer M., and Greenhill C. The complexity of counting graph homomorphisms. Random Structures Algorithms 17 (2000) 260-289
6. Feder T., and Hell P. List homomorphisms to reflexive graphs. J. Combin. Theory B 72 (1998) 236-250
7. Feder T., Hell P., and Huang J. List homomorphisms and circular arc graphs. Combinatorica 19 (1999) 487-505
8. Feder T., Hell P., and Huang J. Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42 (2003) 61-80
9. T. Feder, P. Hell, J. Huang, Extension problems, degrees, and list homomorphisms, manuscript.
10. Galluccio A., Hell P., and Nešetřil J. The complexity of H-colouring of bounded degree graphs. Discrete Math. 222 (2000) 101-109
11. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman & Co., San Francisco
12. Hell P., and Nešetřil J. On the complexity of H-colouring. J. Combin. Theory B 48 (1990) 92-110
13. Hell P., and Nešetřil J. Counting list homomorphisms and graphs with bounded degrees. In: Nešetřil J., and Winkler P. (Eds). Graphs, Morphisms and Statistical Physics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 63 (2004) 105-112
14. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press, Oxford
15. Kratochvíl J., and Sebo{combining double acute accent} A. Coloring precolored perfect graphs. J. Graph Theory 25 (1997) 207-215
16. Kratochvíl J., and Tuza Z. Algorithmic complexity of list colorings. Discrete Appl. Math. 50 (1994) 297-302
17. Maurer H.A., Sudborough J.H., and Welzl E. On the complexity of the general coloring problem. Inform. and Control 51 (1981) 123-145
18. Telle J.A., and Proskurowski A. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10 (1997) 529-550