Coloring claw-free graphs with \Delta-1 colors
Combinatorics
2015-08-06 v2
Abstract
We prove that every claw-free graph that doesn't contain a clique on vertices can be colored.
Keywords
Cite
@article{arxiv.1206.1269,
title = {Coloring claw-free graphs with \Delta-1 colors},
author = {Daniel W. Cranston and Landon Rabern},
journal= {arXiv preprint arXiv:1206.1269},
year = {2015}
}
Comments
18 pages, 4 figures; moved list-coloring section earlier; added overview at end of Section 1 and start of Section 2