Clique minors in claw-free graphs

DOI10.1016/j.jctb.2011.04.005zbMath1237.05176OpenAlexW2140820229MaRDI QIDQ765191

Alexandra Ovetsky Fradkin

Publication date: 19 March 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.04.005

zbMATH Keywords

claw-free graphsHadwiger's conjectureclique minors

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items (2)

Large minors in graphs with given independence number ⋮ Hadwiger’s Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Claw-free graphs. VI: Colouring
• 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 \(K_ 6\)-free graphs
• The four-colour theorem
• Hadwiger's conjecture for line graphs
• Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
• Complete Minors and Independence Number
• Hadwiger's conjecture for quasi-line graphs
• An approximate version of Hadwiger's conjecture for claw-free graphs
• On Hadwiger's Number and the Stability Number
• Subcontraction-equivalence and Hadwiger's conjecture
• On a special case of Hadwiger's conjecture
• Independence number and clique minors

This page was built for publication: Clique minors in claw-free graphs