Hedetniemi's conjecture and dense Boolean lattices

DOI10.1007/S11083-010-9162-4MaRDI QIDQ634737zbMATH OpenOpenAlexWikidataFDO

Authors 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 productsgraph colouringsHedetniemi's conjecture

Mathematics Subject Classification ID

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

Recommendations

• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Hedetniemi's conjecture---a survey
• Hedetniemi's conjecture for Kneser hypergraphs
• Applications of Hajós-type constructions to the Hedetniemi conjecture
• An approach to hedetniemi's conjecture

Cites work

• scientific article; zbMATH DE number 37867 (Why is no real title available?)
• scientific article; zbMATH DE number 3366941 (Why is no real title available?)
• A survey on Hedetniemi's conjecture
• Adjoint functors and tree duality
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Hedetniemi's conjecture---a survey
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• On the arc-chromatic number of a digraph
• Path homomorphisms, graph colorings, and Boolean matrices
• The chromatic number of the product of two 4-chromatic graphs is 4

Cited in

(5)

• \(N\)-dimensional Boolean hypercubes and the Goldbach conjecture
• Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
• scientific article; zbMATH DE number 4048647 (Why is no real title available?)
• scientific article; zbMATH DE number 5130830 (Why is no real title available?)
• On 3-colorings of direct products of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634737)