Hedetniemi's conjecture and dense Boolean lattices

DOI10.1007/s11083-010-9162-4zbMath1223.05085OpenAlexW1976764370WikidataQ123289961 ScholiaQ123289961MaRDI QIDQ634737

Claude Tardif

Publication date: 16 August 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9162-4

zbMATH Keywords

graph productsHedetniemi's conjecturegraph colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On 3-colorings of direct products of graphs ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic number of the product of two 4-chromatic graphs is 4
• On the arc-chromatic number of a digraph
• A survey on Hedetniemi's conjecture
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Adjoint functors and tree duality
• Path homomorphisms, graph colorings, and boolean matrices
• Hedetniemi's conjecture---a survey

This page was built for publication: Hedetniemi's conjecture and dense Boolean lattices