A nine vertex theorem for 3-connected claw- free graphs

DOI10.1556/SSCMATH.38.2001.1-4.16zbMATH Open0997.05052OpenAlexW1994038438MaRDI QIDQ4780293FDOQ4780293

Michael D. Plummer, Ervin Győri

Publication date: 3 November 2002

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.38.2001.1-4.16

Recommendations

• A twelve vertex theorem for 3-connected claw-free graphs
• Cycles through particular subgraphs of claw‐free graphs
• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• Cycles containing 12 vertices in 3-connected cubic graphs
• Circumferences in \(k\)-connected claw-free graphs

zbMATH Keywords

connectivityclaw-free graphscycles in graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (6)

• The Parameterized Complexity of Graph Cyclability
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
• Cycle traversability for claw-free graphs and polyhedral maps
• A twelve vertex theorem for 3-connected claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected

This page was built for publication: A nine vertex theorem for 3-connected claw- free graphs

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