Cycles through ten vertices in 3-connected cubic graphs

DOI10.1007/BF02579136zbMath0561.05036OpenAlexW2069626737MaRDI QIDQ2266024

Charles H. C. Little, Mark N. Ellingham, Derek Holton

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579136

zbMATH Keywords

cyclecubic 3-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (11)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ A twelve vertex theorem for 3-connected claw-free graphs ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Non-Hamiltonian bicubic graphs ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ The ubiquitous Petersen graph ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Cycles through five edges in 3-connected cubic graphs ⋮ Cycles through four edges in 3-connected cubic graphs ⋮ Non-Hamiltonian 3-connected cubic bipartite graphs

Cites Work

• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• A nine point theorem for 3-connected graphs
• A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles through ten vertices in 3-connected cubic graphs