Coloring claw-free graphs with Δ-1 colors

preprint2012arXivOpen access

We prove that every claw-free graph $G$ that doesn't contain a clique on $Δ(G) \geq 9$ vertices can be $Δ(G) - 1$ colored.

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract