On multiplicative graphs and the product conjecture

1988/03/01 by Roland Häggkvist, R. Häggkvist, Pavol Hell +5 · 6 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Class (philosophy) #Combinatorics #Computer science #Conjecture #Discrete mathematics #Graph #Homomorphism #Limits and Structures in Graph Theory #Mathematics #Multiplicative function #Product (mathematics) #Property (philosophy) #Undirected graph

paper · doi:10.1007/bf02122553

crossref issued 1988/03/01 · crossref published 1988/03/01 · crossref published-print 1988/03/01 · openalex publication_date 1988/03/01 · crossref created 2005/10/29 · crossref deposited 2019/05/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/07 · openalex updated_date 2026/07/09

Citations

• The chromatic number of the product of two ℵ1-chromatic graphs can be countable
• The chromatic number of the product of two 4-chromatic graphs is 4
• On the chromatic number of the product of graphs

Cited by

• 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
• On Constraint Satisfaction Problems below P
• Hedetniemi's conjecture [wikipedia]