A survey on Hedetniemi's conjecture

From MaRDI portal
Publication:1387740

DOI10.11650/twjm/1500406890zbMath0906.05024OpenAlexW1483461381WikidataQ123154756 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




Related Items (37)

Strengthening topological colorful results for graphsSome properties on the tensor product of graphs obtained by monogenic semigroupsTopology and Adjunction in Promise Constraint SatisfactionIn praise of homomorphismsSquare-free graphs are multiplicativeShannon capacity and the categorical productEquitable colorings of Kronecker products of graphsMaximum independent sets in direct products of cycles or trees with arbitrary graphsSketchy tweets: ten minute conjectures in graph theoryHedetniemi's conjecture and dense Boolean latticesAltermatic number of categorical product of graphsColoring properties of categorical product of general Kneser hypergraphsInterleaved adjoints of directed graphsThe fractional version of Hedetniemi's conjecture is trueThe \(k\)-independence number of direct products of graphs and Hedetniemi's conjectureOn 3-colorings of direct products of graphsRelatively small counterexamples to Hedetniemi's conjectureHedetniemi's conjecture is asymptotically falseOn idomatic partitions of direct products of complete graphsOn the General Coloring ProblemHedetniemi's conjecture for Kneser hypergraphsCounterexamples to Hedetniemi's conjectureA note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl functionColoring the Cartesian sum of graphsEquitable coloring of Kronecker products of complete multipartite graphs and complete graphsNote on Hedetniemi's conjecture and the Poljak-Rödl functionEquitable colorings of Cartesian products of graphs\(\mathbb{Z}_2\)-indices and Hedetniemi's conjectureA note on the Poljak-Rödl functionAdaptable chromatic number of graph productsChromatic Ramsey numbersMy Top 10 Graph Theory Conjectures and Open ProblemsOn inverse powers of graphs and topological implications of Hedetniemi's conjectureUnique list-colourability and the fixing chromatic number of graphsDensity via duality.On maximum independent set of categorical product and ultimate categorical ratios of graphsCounterexamples to Hedetniemi's conjecture and infinite Boolean lattices




This page was built for publication: A survey on Hedetniemi's conjecture