Browsing Auburn University Graduate School by Author "Galindo, Rachel"

It is well-known that for any graph $G$, $\chi(G)\leq \Delta(G)+1$; Brooks’ Theorem says that all graphs meeting this upper bound must contain either $K_{\Delta(G)+1}$ or be an odd cycle. The Borodin-Kostochka Conjecture, ...