Duality and polynomial testing of tree homomorphisms

Transactions of the American Mathematical Society

Volumn 348, Issue 4, 1996, Pages 1281-1297

  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: 0345969571     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0002-9947-96-01537-1     Document Type: Article

References (35)

1. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340. MR 92d:05150
2. R. Bačík and S. Mahajan, Semidefinite programming and its applications to NP problems, manuscript, 1995.
3. J. Bang-Jansen and P. Hell, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Applied Math. 26 (1990), 1-23. MR 91c:05072
4. J. Bang-Jansen, P. Hell and G. MacGillivray, The complexity of colourings by semicomplete digraphs, SIAM J. Discrete Math. 1 (1988), 281-289. MR 89e:05095
5. J. Bang-Jensen, P. Hell and G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992), 27-44. MR 93m:68051
6. J. Bang-Jensen, P. Hell and G. MacGillivray, Hereditarily hard colouring problems, Discrete Math. 138 (1995), 75-92.
7. J.A. Bondy and U.S.R. Murty, Graph theory with applications, American Elsevier, New York, 1976. MR 54:117
8. B. Courcelle, The monadic second-order logic of graphs, I: Recognizable sets of finite graphs, Information and Computation 85 (1990), 12-75. MR 91g:05107
9. R. Dechter, From local to global consistency, Artificial Intelligence 55 (1992), 87-107. MR 93d:68017
10. T. Feder, Classification of homomorphisms to oriented cycles (draft), manuscript, 1994.
11. T. Feder and M. Y. Vardi, Monotone monadic SNP and constraint satisfaction, 25th Annual ACM Syposium on Theory of Computing, 1993, 612-622.
12. U. Feige and L. Lovász, Two-prover one-round proof systems: Their power and their problems, 24th Annual ACM Syposium on Theory of Computing, 1992, 733-744.
13. M. C. Columbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980. MR 81e:68081
14. W. Gutjahr, Graph colourings, Ph. D. Thesis, Free University Berlin, 1991.
15. W. Gutjahr, E. Welzl and G. Woeginger, Polynomial graph colourings, Discrete Appl. Math. 35 (1992), 29-46.
16. R. P. Häggkvist and P. Hell, Universality of A-mote graphs, European J. of Combinatorics 14 (1993), 23-27. MR 94e:05251
17. P. Hell and J. Nešetřil, On the complexity of H-colouring, J. Combin. Th. (B) 48 (1990), 92-110. MR 91m:68082
18. P. Hell and J. Nešetřil, Homomorphisms of graphs and their orientations, Monatshefte für Math. 85 (1978), 39-48. MR 80a:05110
19. 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.
20. P. Hell, J. Nešetřil and X. Zhu, Complexity of tree homomorphisms, Discrete Appl. Math., to appear.
21. 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), 1995.
22. P. Hell and X. Zhu, The existence of homomorphisms to oriented cycles, SIAM J. on Disc. Math. 8 (1995), 208-222
23. P. Hell and X. Zhu, Homomorphisms to oriented paths, Discrete Math. 132 (1994), 107-114. MR 95:02
24. P. Hell, H. Zhou and X. Zhu, Homomorphisms to oriented cycles, Combinatorica 13 (1993), 421-433. MR 95d:05060
25. P. Komárek, Some new good characterizations of directed graphs, Ćasopis Pést. Mat. 51 (1984), 348-354. MR 87a:05074
26. R. E. Ladner, On the structure of polynomial time reducibility, J. Assoc. Comput. Mach. 22 (1975), 155-171. MR 57:4623
27. G. MacGillivray, On the complexity of colourings by vertex-transitive and arc-transitive digraphs, SIAM J. Discrete Math. 4 (1991), 397-408. MR 92d:05156
28. H.A. Maurer, J.H. Sudborough and E. Welzl, On the complexity of the general colouring problem, Inform, and Control 51 (1981), 123-145. MR 84i:68073
29. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Inf. Sci. 7 (1974), 95-132. MR 54:1739
30. J. Nešetřil, Theory of graphs, SNTL (Praha), 1979.
31. J. Nešetřil and A. Pultr, On classes of relations and graphs determined by subobjects and factorobjects, Discrete Math. 22 (1978), 287-300. MR 80k:05086
32. J. Nešetřil and X. Zhu, On Bounded Treewidth Duality of Graphs, manuscript, 1994.
33. N. Robertson and P.D. Seymour, Graph minors, II: Algorithmic aspects of treewidth, J. Algorithms 7 (1986), 309-322. MR 88c:05053
34. E. Welzl, Symmetric graphs and interpretations, J. Combin. Th. (B) 37 (1984), 235-244.
35. X. Zhu, A polynomial algorithm for homomorphisms to oriented cycles, J. of Algorithms, to appear.