Hadwiger's Conjecture for some graphs with independence number two

arXiv2305.05868MaRDI QIDQ6510035FDOQ6510035

Authors: Tong Li, Qiang Zhou 

Abstract: Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor, $chi(G)$ the chromatic number of $G$ respectively. In 1943, Hadwiger conjectured that $h(G)geqchi(G)$ for any graph $G$. In this paper, we will prove Hadwiger's Conjecture holds for $H$-free graphs with independence number two, where $H$ is any one of 4 given graphs.

This page was built for publication: Hadwiger's Conjecture for some graphs with independence number two

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