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

DOI10.1556/SScMath.38.2001.1-4.16zbMath0997.05052OpenAlexW1994038438MaRDI QIDQ4780293

Michael D. Plummer, Ervin Gyoeri

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

zbMATH Keywords

connectivityclaw-free graphscycles in graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

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

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