Thomassen's conjecture on good 2-colorings of 3-connected cubic graphs is false: infinitely many 3-connected cubic graphs admit no such coloring.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Thomassen's conjecture on good 2-colorings of 3-connected cubic graphs is false: infinitely many 3-connected cubic graphs admit no such coloring.