A note on uniquely 10‐colorable graphs
Matthias Kriesell · Journal of Graph Theory · 2021
Abstract Hadwiger conjectured that every graph of chromatic number admits a clique minor of order . Here we prove for , that every graph of chromatic number with a unique ‐coloring (up to the color names) admits a clique minor of order . The proof does not rely on the Four Color Theorem.