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

DOI10.1002/jgt.20425zbMath1216.05061OpenAlexW4234387146WikidataQ122979949 ScholiaQ122979949MaRDI QIDQ3553232

Maria Chudnovsky, Alexandra Ovetsky Fradkin

Publication date: 22 April 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20425

zbMATH Keywords

coloringclaw-free graphsHadwiger's conjectureclique minors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (4)

Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Domination When the Stars Are Out ⋮ Hadwiger’s Conjecture ⋮ Clique minors in claw-free graphs

Cites Work

• Unnamed Item
• Claw-free graphs. V. Global structure
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for line graphs
• Claw-free graphs. I: Orientable prismatic graphs
• A special case of Hadwiger's conjecture
• Packing seagulls
• Hadwiger's conjecture for quasi-line graphs

This page was built for publication: An approximate version of Hadwiger's conjecture for claw-free graphs