Hadwiger meets Cayley

We show that every connected $k$-chromatic graph contains at least $k^{k-2}$ spanning trees.