A note on uniquely 10-colorable graphs
Hadwiger conjectured that every graph of chromatic number k admits a clique minor of order k. Here we prove for k ≤ 10, that every graph of chromatic number k with a unique k-coloring (up to the color names) admits a clique minor of order k. The proof does not rely on the Four Color Theorem.
Preview
Cite
Rights
Use and reproduction:
