A nine point theorem for 3-connected graphs

DOI10.1007/BF02579281MaRDI QIDQ1165867zbMATH OpenFDO

Authors Carsten Thomassen, Derek Holton, Brendan D. McKay, Michael D. Plummer

Publication date 1982

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

connected cubic graphcycleregular graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cites work

• Circuits containing specified edges
• Cubic identity graphs and planar graphs derived from trees
• Cycles and Connectivity in Graphs
• Cycles through specified vertices of a graph
• Flip-Flops in Hypohamiltonian Graphs
• Graph theory with applications
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs

Cited in

(26)

• The ubiquitous Petersen graph
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• On paths and cycles through specified vertices
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Rooted topological minors on four vertices
• Cycle traversability for claw-free graphs and polyhedral maps
• Cycles through ten vertices in 3-connected cubic graphs
• Destroying longest cycles in graphs and digraphs
• On cycles through specified vertices
• A twelve vertex theorem for 3-connected claw-free graphs
• Cyclability of r-regular r-connected graphs
• An Improved Algorithm for Finding Cycles Through Elements
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• n-arc connected graphs
• Cycles through five edges in 3-connected cubic graphs
• Hamilton‐connected {claw,net}‐free graphs, II
• Hamilton-connected claw-free graphs with Ore-degree conditions
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I
• Hamilton-connected claw-free graphs with minimum-degree conditions
• A note on traversing specified vertices in graphs embedded with large representativity
• (Almost-)optimal FPT algorithm and kernel for T-cycle on planar graphs
• Cycles through four edges in 3-connected cubic graphs
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs

This page was built for publication: A nine point theorem for 3-connected graphs

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