Hedetniemi's conjecture---a survey
From MaRDI portal
Publication:5931456
DOI10.1016/S0012-365X(00)00213-2zbMath0971.05050OpenAlexW2022623224WikidataQ28112255 ScholiaQ28112255MaRDI QIDQ5931456
Publication date: 1 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00213-2
Related Items (28)
In praise of homomorphisms ⋮ Square-free graphs are multiplicative ⋮ Shannon capacity and the categorical product ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Coloring, location and domination of corona graphs ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ Turán numbers of several bipartite graphs ⋮ Hedetniemi's conjecture and dense Boolean lattices ⋮ Graph exponentiation and neighborhood reconstruction ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Hedetniemi's conjecture is asymptotically false ⋮ On idomatic partitions of direct products of complete graphs ⋮ On the General Coloring Problem ⋮ A complexity problem for Borel graphs ⋮ Counterexamples to Hedetniemi's conjecture ⋮ A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function ⋮ Planar graphs are \(9/2\)-colorable ⋮ Coloring the Cartesian sum of graphs ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture ⋮ A note on the Poljak-Rödl function ⋮ Chromatic numbers and products ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs ⋮ The categorical product of two 5-chromatic digraphs can be 3-chromatic ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs
This page was built for publication: Hedetniemi's conjecture---a survey
