A note on uniquely 10-colorable graphs
arXiv:2002.08074
Abstract
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
arXiv:2002.08074
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.