The complexity of H-colouring of bounded degree graphs

Discrete Mathematics

Volumn 222, Issue 1-3, 2000, Pages 101-109

  Galluccio, Anna ^a   Hell, Pavol ^b   Nešetřil, Jaroslav ^c  

^a CNR   (Italy)

^b SIMON FRASER UNIVERSITY   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Algorithms; Colouring; Complexity; Cubic graphs; Homomorphism

Indexed keywords

EID: 0000390221     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00009-1     Document Type: Article

References (12)

1. G. Ausiello, A. D'Atri, D. Saccà, Minimal representations of directed hypergraphs, SIAM J. Comput. 2 (1986) 418-431.
2. R.L. Brooks, On coloring of nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941) 194-197.
3. T. Feder, M. Vardi, Monotone monadic SNP and constraint satisfaction, Proceedings of the 25th ACM STOC, ACM, 1993.
4. M.R. Garey, D.S. Johnson, Computers and Intractability Freeman, New York, 1979.
5. R. Häggkvist, P. Hell, Universality of A-mote graphs, European J. Combin. 14 (1993) 23-27.
6. P. Hell, J. Nešetřil, On the complexity of H-coloring, J. Combin. Theory B 48 (1990) 92-100.
7. P. Hell, J. Nešetřil, X. Zhu, Duality and polynomial testing of tree homomorphism, Trans. Amer. Math. Soc. 348 (1996) 1283-1297.
8. P. Hell, J. Nešetřil, X. Zhu, Duality of graph homomorphism, Combinatorics, Paul Erdos is Eighty (Vol. 2), Bolyai Academy of Mathematical Studies, Kultura, Budapest, 1996, pp. 271-282.
9. I. Holyer, The NP-completeness of edge-colouring, SIAM J. Comput. 10 (1981) 718-720.
10. J. Nešetřil, Ramsey theory, in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Elsevier Science, Amsterdam, 1995 (Chapter 25).
11. J. Neśetŕil, S. Poljak, Complexity of the subgraph problem, Comment. Math. Univ. Carolin. 26 (2) (1985) 415-420.
12. J. Neśetŕil, V. Rödl, Type theory of partition properties of graphs, Recent advances in graph theory, Proceedings Symposium Prague, Academia, Praha, 1975, pp. 405-412.