Sciweavers

Share
JGT
2010

An approximate version of Hadwiger's conjecture for claw-free graphs

9 years 12 months ago
An approximate version of Hadwiger's conjecture for claw-free graphs
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw-free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw-free graph with chromatic number χ has a clique minor of size ⌈2 3χ⌉.
Maria Chudnovsky, Alexandra Ovetsky Fradkin
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JGT
Authors Maria Chudnovsky, Alexandra Ovetsky Fradkin
Comments (0)
books