Graphs with no K9= minor are 10‐colorable
Martin Rolek · Journal of Graph Theory · 2019
Abstract Hadwiger's conjecture claims that any graph with no minor is ‐colorable. This has been proved for , but remains open for . As a variant of this conjecture, graphs with no minor have been considered, where denotes the complete graph with two edges removed. It has been shown that graphs with no minor are ‐colorable for . In this paper, we extend this result to the case and show that graphs with no minor are ‐colorable.