Coloring claw-free graphs with \Delta-1 colors
  We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored. 
Daniel W. Cranston and Landon Rabern
math.CO