A nine point theorem for 3-connected graphs
From MaRDI portal
Publication:1165867
DOI10.1007/BF02579281zbMath0488.05047MaRDI QIDQ1165867
Carsten Thomassen, Derek Holton, Michael D. Plummer, Brendan D. McKay
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Related Items
On paths and cycles through specified vertices, A twelve vertex theorem for 3-connected claw-free graphs, Circuits through prescribed vertices in k‐connected k‐regular graphs, $n$-Arc connected graphs, Hamilton‐connected {claw,net}‐free graphs, II, Hamilton-connected claw-free graphs with Ore-degree conditions, An Improved Algorithm for Finding Cycles Through Elements, Hamilton‐connected {claw, bull}‐free graphs, Hamilton‐connected {claw, net}‐free graphs, I, Cycle traversability for claw-free graphs and polyhedral maps, Cycles through a prescribed vertex set in \(n\)-connected graphs., Cyclability of r-regular r-connected graphs, The ubiquitous Petersen graph, Cycles through ten vertices in 3-connected cubic graphs, A note on traversing specified vertices in graphs embedded with large representativity, On cycles through specified vertices, Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected, Cycles through five edges in 3-connected cubic graphs, Cycles through four edges in 3-connected cubic graphs, Hamiltonicity and minimum degree in 3-connected claw-free graphs, One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture, Rooted topological minors on four vertices, Hamiltonian cycles in cubic 3-connected bipartite planar graphs, Destroying longest cycles in graphs and digraphs
Cites Work
- Unnamed Item
- Cycles through specified vertices of a graph
- Circuits containing specified edges
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Cycles and Connectivity in Graphs
- Cubic identity graphs and planar graphs derived from trees
- Flip-Flops in Hypohamiltonian Graphs
