On the chromatic number of the product of graphs
From MaRDI portal
Publication:3815317
DOI10.1002/jgt.3190090409zbMath0664.05019OpenAlexW2167519573WikidataQ64356945 ScholiaQ64356945MaRDI QIDQ3815317
Bill Sands, Dwight Duffus, Robert E. Woodrow
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090409
Related Items (21)
On multiplicative graphs and the product conjecture ⋮ Lattices arising in categorial investigations of Hedetniemi's conjecture ⋮ Multiplicativity of acyclic digraphs ⋮ Equitable colorings of Kronecker products of graphs ⋮ Universal completability, least eigenvalue frameworks, and vector colorings ⋮ Coloring graph products---a survey ⋮ Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs ⋮ Vector coloring the categorical product of graphs ⋮ On optimizing edge connectivity of product graphs ⋮ Achromatic numbers and graph operations ⋮ Counterexamples to Hedetniemi's conjecture ⋮ Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs ⋮ Multiplicativity of acyclic local tournaments ⋮ The thickness of the Kronecker product of graphs ⋮ Chromatic Ramsey numbers ⋮ Chromatic numbers and products ⋮ The chromatic number of the product of two 4-chromatic graphs is 4 ⋮ Homomorphisms to oriented cycles ⋮ Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture ⋮ Projectivity and independent sets in powers of graphs
Cites Work
This page was built for publication: On the chromatic number of the product of graphs
