Structure of 4-connected claw-free graphs not containing a subdivision of K₅

DOI10.1016/J.DISC.2011.02.022MaRDI QIDQ536211zbMATH OpenOpenAlexFDO

Authors Roi Krakovski, D. Christopher Stephens

Publication date 16 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.02.022

zbMATH Keywords

claw-free graphs4-connectedsubdivisions of \(K_{5}\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• On the structure of graphs without claw, \(4K_1\) and co-R
• scientific article; zbMATH DE number 1753165
• Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
• \(K_5^-\)-subdivision in 4-connected graphs
• On factors of 4-connected claw-free graphs
• The structure of claw-free graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• On 4-connected claw-free well-covered graphs

Cites work

• Characterizations of derived graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Topological minors in line graphs -- a proof of Zha's conjecture

Cited in

(6)

• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• Subdivisions of \(K_{5}\) in graphs embedded on surfaces with face-width at least 5
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
• Topological minors in line graphs -- a proof of Zha's conjecture
• On the structure of graphs without claw, \(4K_1\) and co-R
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs

This page was built for publication: Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536211)