A survey on Hedetniemi's conjecture
From MaRDI portal
Publication:1387740
DOI10.11650/twjm/1500406890zbMath0906.05024OpenAlexW1483461381WikidataQ123154756 ScholiaQ123154756MaRDI QIDQ1387740
Publication date: 14 February 1999
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500406890
Related Items (37)
Strengthening topological colorful results for graphs ⋮ Some properties on the tensor product of graphs obtained by monogenic semigroups ⋮ Topology and Adjunction in Promise Constraint Satisfaction ⋮ In praise of homomorphisms ⋮ Square-free graphs are multiplicative ⋮ Shannon capacity and the categorical product ⋮ Equitable colorings of Kronecker products of graphs ⋮ Maximum independent sets in direct products of cycles or trees with arbitrary graphs ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ Hedetniemi's conjecture and dense Boolean lattices ⋮ Altermatic number of categorical product of graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Interleaved adjoints of directed graphs ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture ⋮ On 3-colorings of direct products of graphs ⋮ 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 ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ Counterexamples to Hedetniemi's conjecture ⋮ A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function ⋮ Coloring the Cartesian sum of graphs ⋮ Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ Equitable colorings of Cartesian products of graphs ⋮ \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture ⋮ A note on the Poljak-Rödl function ⋮ Adaptable chromatic number of graph products ⋮ Chromatic Ramsey numbers ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture ⋮ Unique list-colourability and the fixing chromatic number of graphs ⋮ Density via duality. ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
This page was built for publication: A survey on Hedetniemi's conjecture