Hedetniemi's conjecture and dense Boolean lattices

DOI10.1007/S11083-010-9162-4zbMATH Open1223.05085OpenAlexW1976764370WikidataQ123289961 ScholiaQ123289961MaRDI QIDQ634737FDOQ634737

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

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

zbMATH Keywords

graph productsgraph colouringsHedetniemi's conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
• \(N\)-dimensional Boolean hypercubes and the Goldbach conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)