Algebraic Graph Theory pp 103-134 | Cite as

# Homomorphisms

## Abstract

Although any isomorphism between two graphs is a homomorphism, the study of homomorphisms between graphs has quite a different flavour to the study of isomorphisms. In this chapter we support this claim by introducing a number of topics involving graph homomorphisms. We consider the relationship between homomorphisms and graph products, and in particular a famous unsolved conjecture of Hedetniemi, which asserts that if two graphs are not *n*-colourable, then neither is their product. Our second major topic is the exploration of the core of a graph, which is the minimal subgraph of a graph that is also a homomorphic image of the graph. Studying graphs that are equal to their core leads us to an interesting class of graphs first studied by Andrásfai. We finish the chapter with an exploration of the cores of vertex-transitive graphs.

### Keywords

Itive Graph Fullerene Eter Tria Diam Eter## Preview

Unable to display preview. Download preview PDF.

### References

- [1]B. Andrásfai,
*Graphentheoretische Extremalprobleme*, Acta Math. Acad. Sci. Hungar, 15 (1964), 413–438.MathSciNetMATHCrossRefGoogle Scholar - [2]B. Andrásfai,
*Introductory Graph Theory*, Pergamon Press Inc., Elmsford, N.Y., 1977.MATHGoogle Scholar - [3]A. E. Brouwer,
*Finite graphs in which the point neighbourhoods are the maximal independent sets*, in From universal morphisms to megabytes: a Baayen space Odyssey, Math. Centrum Centrum Wisk. Inform., Amsterdam, 1994, 231–233.Google Scholar - [4]S. A. Burr, P. Erdős, and L. Lovasz,
*On graphs of Ramsey type*, Ars Combinatoria, 1 (1976), 167–190.MathSciNetMATHGoogle Scholar - [5]D. Duffus, B. Sands, and R. E. Woodrow,
*On the chromatic number of the product of graphs*, J. Graph Theory, 9 (1985), 487–495.MathSciNetMATHCrossRefGoogle Scholar - [6]D. Duffus and N. Sauer,
*Lattices arising in categorial investigations of Hedetniemi’s conjecture*, Discrete Math., 152 (1996), 125–139.MathSciNetMATHCrossRefGoogle Scholar - [7]M. El-Zahar and N. W. Sauer,
*The chromatic number of the product of two*4-*chromatic graphs is*4, Combinatorica, 5 (1985), 121–126.MathSciNetMATHCrossRefGoogle Scholar - [8]J. L. Gross and T. W. Tucker,
*Topological Graph Theory*, John Wiley & Sons Inc., New York, 1987.MATHGoogle Scholar - [9]R. Häggkvist,
*Odd cycles of specified length in nonbipartite graphs*, in Graph Theory, North-Holland, Amsterdam, 1982, 89–99.Google Scholar - [10]R. Häggkvist, P. Hell, D. J. Miller, and V. Neumann Lara,
*On multiplicative graphs and the product conjecture*, Combinatorica, 8 (1988), 63–74.MathSciNetMATHCrossRefGoogle Scholar - [11]G. Hahn and C. Tardif,
*Graph homomorphisms: structure and symmetry*, in Graph symmetry (Montreal, PQ, 1996), Kluwer Acad. Publ., Dordrecht, 1997, 107–166.Google Scholar - [12]P. Hell,
*Absolute retracts in graphs*, Lecture Notes in Math., 406 (1974), 291–301.MathSciNetCrossRefGoogle Scholar - [13]P. Hell,
*Subdirect products of bipartite graphs*, Colloq. Math. Soc. János Bolyai, 10 (1975), 857–866.MathSciNetGoogle Scholar - [14]P. Hell and J. Nešetřil,
*On the complexity of H-coloring*, J. Combin. Theory Ser. B, 48 (1990), 92–110.MathSciNetMATHCrossRefGoogle Scholar - [15]W. Imrich and H. Izbicki,
*Associative products of graphs*, Monatsh. Math., 80 (1975), 277–281.MathSciNetMATHCrossRefGoogle Scholar - [16]
- [17]B. Larose and C. Tardif,
*Eedetniem’s conjecture and the retracts of a product of graphs*, Combinatorica, 20 (2000), 531–544.MathSciNetMATHCrossRefGoogle Scholar - [18]L. Lovász,
*Combinatorial Problems and Exercises*, North-Holland Publishing Co., Amsterdam, 1979.MATHGoogle Scholar - [19]J. Nešetřil,
*Homomorphisms of derivative graphs*, Discrete Math., 1 (1971/72), 257–268.MathSciNetMATHCrossRefGoogle Scholar - [20]J. Pach,
*Graphs whose every independent set has a common neighbour*, Discrete Math., 37 (1981), 217–228.MathSciNetMATHCrossRefGoogle Scholar - [21]E. Welzl,
*Symmetric graphs and interpretations*, J. Combin. Theory Ser. B, 37 (1984), 235–244.MathSciNetMATHCrossRefGoogle Scholar