The chromatic number of the product of two 4-chromatic graphs is 4

Abstract

For any graphG and numbern≧1 two functionsf, g fromV(G) into {1, 2, ...,n} are adjacent if for all edges (a, b) ofG, f(a)g(b). The graph of all such functions is the colouring graph ℒ(G) ofG. We establish first that χ(G)=n+1 implies χ(ℒ(G))=n iff χ(G ×H)=n+1 for all graphsH with χ(H)≧n+1. Then we will prove that indeed for all 4-chromatic graphsG χ(ℒ(G))=3 which establishes Hedetniemi’s [3] conjecture for 4-chromatic graphs.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    S. A. Burr, P. Erdős andL. Lovász, On graphs of Ramsey type,Ars Comb. 1 (1976), 167–190.

    MATH  Google Scholar 

  2. [2]

    D. Duffus, B. Sands andR. E. Woodrow, On the Chromatic Number of the Product of Graphs,Journal of Graph Theory, to appear.

  3. [3]

    S. T. Hedetniemi, Homomorphisms of graphs and automata,Univ. of Michigan Technical Report 03105-44-T, 1966.

Download references

Author information

Affiliations

Authors

Additional information

This research was supported by NSERC grant A7213

Rights and permissions

Reprints and Permissions

About this article

Cite this article

El-Zahar, M., Sauer, N. The chromatic number of the product of two 4-chromatic graphs is 4. Combinatorica 5, 121–126 (1985). https://doi.org/10.1007/BF02579374

Download citation

AMS subject classification (1980)

  • 05 C 15