Abstract
The chromatic number of G×H can be less than the minimum of the chromatic numbers of finite simple graphs G and H.
Author supplied keywords
Cite
CITATION STYLE
APA
Shitov, Y. (2019). Counterexamples to Hedetniemi’s conjecture. Annals of Mathematics, 190(2), 663–667. https://doi.org/10.4007/annals.2019.190.2.6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free