A survey on Hedetniemi's conjecture

DOI10.11650/twjm/1500406890zbMath0906.05024WikidataQ123154756 ScholiaQ123154756MaRDI QIDQ1387740

Xuding Zhu

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

zbMATH Keywords

Hedetniemi's conjecture; \(n\)-colorable

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Coloring properties of categorical product of general Kneser hypergraphs, My Top 10 Graph Theory Conjectures and Open Problems, Some properties on the tensor product of graphs obtained by monogenic semigroups, Square-free graphs are multiplicative, Hedetniemi's conjecture for Kneser hypergraphs, Equitable colorings of Kronecker products of graphs, Hedetniemi's conjecture and dense Boolean lattices, 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 idomatic partitions of direct products of complete graphs, Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs, Equitable colorings of Cartesian products of graphs, Maximum independent sets in direct products of cycles or trees with arbitrary graphs, Coloring the Cartesian sum of graphs, Adaptable chromatic number of graph products, Chromatic Ramsey numbers, Altermatic number of categorical product of graphs, On 3-colorings of direct products of graphs, Density via duality., On maximum independent set of categorical product and ultimate categorical ratios of graphs, Strengthening topological colorful results for graphs, Sketchy tweets: ten minute conjectures in graph theory, Unique list-colourability and the fixing chromatic number of graphs, On the General Coloring Problem