Path homomorphisms

Mathematical Proceedings of the Cambridge Philosophical Society

Volumn 120, Issue 2, 1996, Pages 207-220

  Nešetřil, Jaroslav ^a   Zhu, Xuding ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344464502     PISSN: 03050041     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0305004100074806     Document Type: Article

References (29)

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 digraphs. Discrete Applied Math. 26 (1990), 1-23.
3. J. BANG-JANSEN, P. HELL and G. MACGILLIVRAY. The complexity of colorings by semi-complete digraphs. SIAM J. Discrete Math. 1 (1988), 281-289.
4. J. BANG-JANSEN, P. HELL and G. MACGILLIVRAY. On the complexity of colouring by superdigraphs of bipartite graphs. Discrete Math., to appear.
5. J. BANG-JANSEN, P. HELL and G. MACGILLIVRAY. Hereditarily hard colouring problems, submitted to J. Comput. Systems Science.
6. W. GUTJAHR. Graph colorings (Ph.D. Thesis, Free University, Berlin, 1991).
7. W. GUTJAHR, E. WELZL and G. WOEGINGER. Polynomial graph colorings. Discrete Applied Math. 35 (1992), 29-46.
8. R. P. HÄGGKVIST and P. HELL. Universality of A-mote graphs. Europ. J. of Combin. 14 (1993), 23-27.
9. C. HIGMAN. Ordering by divisibility in abstract algebra. Proc. London Math. Soc. 2 (1952), 326-336.
10. R. P. HÄGGKVIST, P. HELL, D. J. MILLER and V. NEUMAN LARA. On multiplicativite graphs and the product conjecture. Combinatorica 8 (1988), 63-74.
11. P. HELL. An introduction to the category of graphs. Annals of the N.Y. Acad. Sc. 328 (1979), 120-136.
12. P. HELL and J. NEŠETŘIL. On the complexity of H-coloring. J. Combin. Th. (B) 48 (1990), 92-110.
13. P. HELL and J. NEŠETŘIL. Images of rigid digraphs. Europ. J. Combin., 12 (1991), 33-42.
14. P. HELL and J. NEŠETŘIL. Homomorphisms of graphs and their orientations. Monatshefte für Math. 85 (1978), 39-48.
15. P. HELL and J. NEŠETŘIL. The core of a graph. Discrete Math. 109 (1992), 117-126.
16. P. HELL, J. NEŠETŘIL and X. ZHU. Complexity of tree homomorphisms, submitted.
17. P. HELL, J. NEŠETŘIL and X. ZHU. Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc., to appear.
18. P. HELL, J. NEŠETŘIL and X. ZHU. Duality of graph homomorphisms; in Combinatorics, Paul Erdös is Eighty, Vol. 2 (Bolyai Society Mathematical Studies, Budapest, 1994).
19. P. HELL, and X. ZHU. The existence of homomorphisms to oriented cycles. SIAM J. on Disc. Math., to appear.
20. P. HELL, and X. ZHU. Homomorphisms to oriented paths. Discrete Math., 132 (1994), 107-114.
21. P. HELL, H. ZHOU and X. ZHU. Homomorphisms to oriented cycles. Combinatorica 13 (1993), 421-433.
22. P. HELL, H. ZHOU and X. ZHU. Multiplicativity of oriented cycles. J. Comb. Th. (B) 60 (1994), 239-253.
23. P. KOMÁREK. Some new good characterizations of directed graphs. Časopis Pěst. Mat. 51 (1984), 348-354.
24. H. A. MAURER, J. H. SUDBOROUGH and E. WELZL. On the complexity of the general coloring problem. Inform. and Control 51 (1981), 123-145.
25. J. NEŠETŘIL. Theory of graphs (SNTL (Praha), 1979).
26. J. NEŠETŘIL and A PULTR. On classes of relations and graphs determined by subobjects and factorobjects. Discrete Math. 22 (1978), 287-300.
27. W. T. TROTTER. Dimension theory of partially ordered sets (Johns Hopkins University Press, 1992).
28. E. WELZL. Symmetric graphs and interpretations. J. Combin. Th. (B) 37 (1984), 235-244.
29. X. ZHU. A polynomial algorithm for homomorphisms to oriented cycles. J. Algorithms (to appear).