Every graph with no K_7^∨-minor (K_7 with two edges sharing an endpoint deleted) is 6-colorable, proved via a new extremal theorem for 4-connected graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Every graph with no $K_7^{\vee}$-minor is $6$-colorable
Every graph with no K_7^∨-minor (K_7 with two edges sharing an endpoint deleted) is 6-colorable, proved via a new extremal theorem for 4-connected graphs.