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

1985/06/01 by Mohamed H. El-Zahar, Mohamed El-Zahar, Norbert Sauer · 9 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Conjecture #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Mathematics #Product (mathematics)

paper · doi:10.1007/bf02579374

crossref issued 1985/06/01 · crossref published 1985/06/01 · crossref published-print 1985/06/01 · openalex publication_date 1985/06/01 · crossref created 2007/03/22 · crossref deposited 2019/05/18 · openalex created_date 2025/10/10 · crossref indexed 2026/07/07 · openalex updated_date 2026/07/09

Citations

• On the chromatic number of the product of graphs

Cited by

• On multiplicative graphs and the product conjecture
• On the chromatic number of the product of graphs
• The chromatic number of the product of two ℵ1-chromatic graphs can be countable
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function
• Coloring graph products — A survey
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• A SURVEY ON HEDETNIEMI'S CONJECTURE
• Fractional chromatic numbers of cones over graphs
• Hedetniemi's conjecture [wikipedia]