Hedetniemi's conjecture - A survey

Discrete Mathematics

Volumn 229, Issue 1-3, 2001, Pages 261-292

  Sauer, Norbert ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Hedetniemi conjecture; Homomorphism; Multiplicative; Product

Indexed keywords

EID: 0346609929     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00213-2     Document Type: Article

References (43)

1. R. Baćik, Structure of graph homomorphisms, Ph.D. Thesis, Simon Fraser University, 1998.
2. J. Bang-Jensen, P. Hell, G. Gillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992) 24-44.
3. G. Birkhoff, Extended arithmetic, Duke Math. J. 3 (1937) 311-316.
4. G. Birkhoff, Generalized arithmetic, Duke Math. J. 12 (1942) 283-302.
5. S. Burr, P. Erdos, L. Lovász, On graphs of Ramsey type, Ars Combin. 1 (1976) 167-190.
6. N.G. de Bruijn, P. Erdos, A colour problem for infinite graphs and a problem in the theory of relations, Indag. Math. 13 (1951) 369-373.
7. C. Delhommé, N. Sauer, Homomorphisms from products into square free graphs, Combinatorica, to appear.
8. R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950) 161-166.
9. D. Duffus, B. Sands, R. Woodrow, On the chromatic number of the product of graphs, J. Graph Theory 9 (1985) 487-495.
10. D. Duffus, N. Sauer, Lattices arising in categorical investigations of Hedetniemi's conjecture, Discrete Math. 152 (1996) 125-139.
11. E. El-Zahar, N. Sauer, The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985) 121-126.
12. R.C. Entringer, C.C. Harner, Arc colorings of digraphs, J. Combin. Theory Ser. B 13 (1972) 219-225.
13. P. Erdös, A. Hajnal, On chromatic number of graphs and setsystems, Acta. Math. Acad. Sci. Hung. 17 (1966) 61-99.
14. R. Goldblatt, Topoi; The Categorial Analysis of Logic, Studies in Logic and the Foundations of Mathematics, vol. 98, North-Holland, Amsterdam.
15. G. Grätzer, Lattice Theory, W.H. Freeman, San Francisco, CA, 1971.
16. R. Häggkvist, P. Hell, D.J. Miller, V.N. Lara, On multiplicative graphs and the product conjecture, Combinatorica 8 (1) (1988) 63-74.
17. ⊥1 chromatic graphs can be countable, Combinatorica 5 (1985) 137-140.
18. G. Hajós, Über eine Konstruktion nicht n-färbbarer Graphen, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math. Natur. Reihe 10 (1961) 116-117.
19. S.T. Hedetniemi, Homomorphisms and graph automata, University of Michigan Technical Report 03105-44-T, 1966.
20. P. Hell, H. Zhou, X. Zhu, Homomorphisms to oriented cycles, Combinatorica 13 (1993) 421-433.
21. L. Lovász, Operations with structures, Acta Math. Acad. Sci. Hung. (1967) 321-328.
22. D.J. Miller, The categorical product of graphs, Canad. J. Math. 20 (1968) 1511-1521.
23. J. Nešetřil, Structure of graph homomorphisms I, Graph Theory Notes of New York, New York Academy of Science, 1998, pp. 7-12.
24. J. Nešetřil, The homomorphism structure of classes of graphs, Recent trends in combinatorics, Combin. Probab. Comput. 8 (1999) 177-184.
25. J. Nešetřil, A. Pultr, On classes of relations and graphs determined by subobjects and factorobjects, Discrete Math. 22 (1978) 287-300.
26. J. Nešetřil, C. Tardif, Duality theorems for finite structures, J. Combin. Theory Ser. 80 (2000) 90-97.
27. J. Nešetřil, C. Tardif, A new proof of the density of directed and undirected graphs, manuscript.
28. J. Nešetřil, C. Tardif, Density, Contemporary Trends in Discrete Mathematics (Štiřin Castle, 1997), DIMACS Series Discrete Mathematical Theoretical Computer Science, vol. 49, pp. 229-236, American Mathematical Society, Providence, RI, 1999.
29. S. Poljak, Coloring digraphs by iterated antichains, Comment. Math. Univ. Carolinae 32 (2) (1991) 209-212.
30. S. Poljak, V. Rödl, On the arc-chromatic number of a digraph, J. Combin. Theory, Ser. B 31 (1981) 190-198.
31. G. Sabidussi, Graph multiplication, Math. Z. 72 (1960) 446-457.
32. N.W. Sauer, X. Zhu, Multiplicative Posets, Order 8 (1992) 349-358.
33. N. Sauer, X. Zhu, An approach to Hedetniemi's conjecture, J. Graph Theory 16 (1992) 423-436.
34. N. Sauer, X. Zhu, Multiplicative posets, Order 8 (1992) 349-358.
35. E. Sperner, Ein Satz über Untermengen einer endlichen Menge, Math. Zeit. 27 (1928) 544-548.
36. D. Turzík, A note on the chromatic number of the direct product of graphs, Comment. Math. Univ. Carolinae 24 (1983) 461-463.
37. E. Welzl, Symmetric graphs and interpretations, J. Combin. Theory Ser. B 37 (1982) 29-41.
38. E. Welzl, Color families are dense, Theoret. Comput. Sci. 17 (1982) 29-41.
39. H. Zhou, Homomorphism properties of graph products, Ph.D. Thesis, Simon Fraser University, 1988.
40. H. Zhou, X. Zhu, On the multiplicativity of acyclic local tournaments, Combinatorica 17 (2000) 135-145.
41. X. Zhu, Multiplicative structures, Ph. D. Thesis, The University of Calgary, 1990.
42. X. Zhu, A simple proof of the multiplicativity of directed cycles of prime power length, Discrete Appl. Math. 36 (1992) 313-315.
43. X. Zhu, A survey on Hedetniemi's conjecture, Taiwanese J. Math. 2 (1) (1998) 1-24.