Back to Search
Start Over
Coloring claw-free graphs with ��-1 colors
- Publication Year :
- 2012
- Publisher :
- arXiv, 2012.
-
Abstract
- We prove that every claw-free graph $G$ that doesn't contain a clique on $��(G) \geq 9$ vertices can be $��(G) - 1$ colored.<br />18 pages, 4 figures; moved list-coloring section earlier; added overview at end of Section 1 and start of Section 2
- Subjects :
- 05C15
FOS: Mathematics
Combinatorics (math.CO)
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi...........dad52441b96990ccd6c41d636bb08129
- Full Text :
- https://doi.org/10.48550/arxiv.1206.1269