Coloring claw-free graphs with \Delta-1 colors

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