A polynomial algorithm for homomorphisms to oriented cycles

Journal of Algorithms

Volumn 19, Issue 3, 1995, Pages 333-345

  Zhu, Xuding ^a,b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345656669     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.1040     Document Type: Article

References (19)

1. G. Bloom and S. Burr, On unavoidable digraphs in orientations of graphs, J. Graph Theory 11 (1987), 453-462.
2. 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.
3. J. Bang-Jansen, P. Hell, and G. MacGillivray, The complexity of colorings by semicom-plete digraphs, SIAM J. Discrete Math. 1 (1988), 281-289.
4. J. Bang-Jensen, P. Hell, and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992), 27-44.
5. J. Bang-Jensen, P. Hell, and G. MacGillivray, Hereditarily hard colouring problems. Discrete Math., to appear.
6. T. Feder and M. Y. Vardi, Monotone monadic SNP and constraint satisfaction, in "Proc. 25th ACM STOC 1993, " pp. 612-622.
7. T. Feder, Classification of homomorphism to oriented cycles, manuscript, 1993.
8. M. R. Garey and D. S. Johnson, "Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
9. W. Gutjahr, "Colorings of Oriented Graphs, " Ph.D. Thesis. Free University, Berlin. 1991.
10. W. Gutjahr, E. Welzl, and G. Woeginger, Polynomial graph colorings. Discrete Appl. Math. 35 (1992), 29-46.
11. R. P. Haggkvist, P. Hell, D. J. Miller, and V. Neuman Lara, On multiplicativite graphs and the product conjecture, Combinatorica 8 (1988), 63-74.
12. P. Hell and J. Nesetril, On the complexity of W-coloring, J. Combin. Theory Ser. B 48 (1990), 92-110.
13. P. Hell and J. Nesetril, Homomorphisms of graphs and their orientations, Monatsh. Math. 85 (1978), 39-48.
14. P. Hell, J. Nesetril, and X. Zhu, Complexity of tree homomorphisms, Discrete Appl. Math., to appear.
15. P. Hell, J. Nesetril, and X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc., to appear.
16. P. Hell, J. Nesetril, and X. Zhu, Duality of graph homomorphisms, in "Combinatorics, Paul Erdos is Eighty, " Vol. 2, Bolyai Society Mathematical Studies, Budapest, 1994.
17. P. Hell and X. Zhu, The existence of homomorphisms to oriented cycles, SIAM J. Discrete Math. 8 (2) (1995), 208-222.
18. G. MacGillivray, On the complexity of colourings by vertex-transitive and arc-transitive digraphs, SIAMJ. Discrete Math. 4 (1991), 397-408.
19. H. A. Maurer, J. H. Sudborough, and E. Welzl, On the complexity of the general coloring problem, Inform, and Control 51 (1981), 123-145.