A note on uniquely 10-colorable graphs
Combinatorics
2020-02-20 v1
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.
Cite
@article{arxiv.2002.08074,
title = {A note on uniquely 10-colorable graphs},
author = {Matthias Kriesell},
journal= {arXiv preprint arXiv:2002.08074},
year = {2020}
}