%0 Journal Article
%T Coloring claw-free graphs with жд-1 colors
%A Daniel W. Cranston
%A Landon Rabern
%J Mathematics
%D 2012
%I arXiv
%X 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.
%U http://arxiv.org/abs/1206.1269v2