Coloring claw-free graphs with \Delta-1 colors
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2012
- DOI:
- 10.48550/arXiv.1206.1269
- arXiv:
- arXiv:1206.1269
- Bibcode:
- 2012arXiv1206.1269C
- Keywords:
-
- Mathematics - Combinatorics;
- 05C15
- E-Print:
- 18 pages, 4 figures