An 11-vertex theorem for 3-connected cubic graphs

DOI10.1002/jgt.3190120412zbMath0671.05048OpenAlexW1968787900MaRDI QIDQ3824445

Bau Sheng, R. E. L. Aldred, Derek Holton, Gordon F. Royle

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120412

zbMATH Keywords

cycle3-connected cubic graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ The ubiquitous Petersen graph

Cites Work

• Zur Theorie der n-fach zusammenhängenden Graphen
• Unnamed Item
• Unnamed Item

This page was built for publication: An 11-vertex theorem for 3-connected cubic graphs