Cycles containing 12 vertices in 3-connected cubic graphs
From MaRDI portal
Publication:3980624
DOI10.1002/jgt.3190150407zbMath0747.05050OpenAlexW2057454583MaRDI QIDQ3980624
Publication date: 26 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190150407
Related Items (7)
A twelve vertex theorem for 3-connected claw-free graphs ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Circumference of 3-connected cubic graphs ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Cites Work
This page was built for publication: Cycles containing 12 vertices in 3-connected cubic graphs
