Coloring claw-free graphs with Δ-1 colors

Abstract

We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta (G)\ge 9$ vertices can be $\Delta (G)-1$ colored.

18 pages, 4 figures; moved list-coloring section earlier; added overview at end of Section 1 and start of Section 2