Complexity of tree homomorphisms

Discrete Applied Mathematics

Volumn 70, Issue 1, 1996, Pages 23-36

  Hell, P ^a   Nesetril J ^b   Zhu, X ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b CHARLES UNIVERSITY   (Czech Republic)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544270178     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)00099-6     Document Type: Article

References (26)

1. J. Bang-Jansen and P. Hell, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Appl. Math. 26 (1990) 1-23.
2. J. Bang-Jansen, P. Hell and G. MacGillivray, The complexity of colourings by semicomplete digraphs, SIAM J. Discrete Math. 1 (1988) 281-289.
3. J. Bang-Jensen, P. Hell and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992) 27-44.
4. J. Bang-Jensen, P. Hell and G. MacGillivray, Hereditarily hard colouring problems, Discrete Math. 138 (1995) 75-92.
5. T. Feder. Classification of homomorphisms to oriented cycles (draft), manuscript, 1994.
6. T. Feder and P. Hell, List homomorphisms to reflexive graphs, manuscript 1995.
7. T. Feder, P. Hell and J. Huang, List homomorphisms to bipartite graphs, manuscript, 1995.
8. T. Feder and M.Y. Vardi, Monotone monadic SNP and constraint satisfaction, in 25th Annu. ACM Symp. on Theory of Computing (1993) 612-622.
9. M.R. Gary and D.S. Johnson, Computers and Intractability (Freeman, NY, 1979).
10. W. Gutjahr, Graph colourings, Ph.D. Thesis, Free University Berlin, 1991.
11. W. Gutjahr, E. WeIzI and G. Woeginger, Polynomial graph colourings, Discrete Appl. Math. 35 (1992) 29-46.
12. R. Häggkvist, P. Hell, D.J. Miller and V. Neumann Lara, On multiplicative graphs and the product conjecture, Combinatorica 8 (1988) 71-81.
13. P. Hell and J. Nešetřil, Homomorphisms of graphs and their orientations, Monatsh. Math. 85 (1978) 39-48.
14. P. Hell and J. Nešetřil, On the complexity of H-colouring, J. Combin. Theory Ser. 48 (1990) 92-110.
15. P. Hell and J. Nešetřil, Images of rigid digraphs, European J. Combin. 12 (1991) 33-42.
16. P. Hell and J. Nešetřil, The core of a graph, Discrete Math. 109 (1992) 117-126.
17. P. Hell, J. Nešetřil and X. Zhu, Duality and polynomial testing of tree homomorphisms, Technical Report, KAM series 93-243, Department of Applied Mathematics, Charles University, Prague, 1993.
18. P. Hell, J. Nešetřil and X. Zhu, Duality of graph homomorphisms, Combinatorics, Paul Erdös is Eighty, Vol. 2 (Bolyai Society Mathematical Studies, Budapest, Hungary, 1993).
19. P. Hell, J. Nešetřil and X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. AMS, in print.
20. P. Hell, H. Zhou and X. Zhu, Homomorphisms to oriented cycles, Combinatorica 13 (1993) 421-433.
21. P. Hell and X. Zhu, Homomorphisms to oriented paths, Discrete. Math. 132 (1994), 107-114.
22. P. Hell and X. Zhu, The existence of homomorphisms to oriented cycles, SIAM J. Discrete Math., 8 (1995) 208-222.
23. G. MacGillivray, On the complexity of colourings by vertex-transitive and arc-transitive digraphs, SIAM J. Discrete Math, in press.
24. H.A. Maurer, J.H. Sudborough and E. Welzl, On the complexity of the general colouring problem, Inform. and Control 51 (1981) 123-145.
25. E. Welzl, Symmetric graphs and interpretations, J. Combin. Theory Ser. B 37 (1984) 235-244.
26. X. Zhu, A polynomial algorithm for homomorphisms to oriented cycles, J. Algorithms, to appear.