Hadwiger meets Cayley

MaRDI QIDQ6340569zbMATH OpenFDO

Authors Jacob W. Cooper, Adam Kabela, Daniel Král', Théo Pierron

Publication date 12 May 2020

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

This page was built for publication: Hadwiger meets Cayley

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340569)