Cycles through ten vertices in 3-connected cubic graphs
From MaRDI portal
(Redirected from Publication:2266024)
Recommendations
Cites work
- scientific article; zbMATH DE number 3767710 (Why is no real title available?)
- A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
- A nine point theorem for 3-connected graphs
- Graph theory with applications
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
Cited in
(17)- scientific article; zbMATH DE number 4027507 (Why is no real title available?)
- scientific article; zbMATH DE number 16299 (Why is no real title available?)
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- Cycle traversability for claw-free graphs and polyhedral maps
- scientific article; zbMATH DE number 1536529 (Why is no real title available?)
- Cycles through five edges in 3-connected cubic graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Cycles through four edges in 3-connected cubic graphs
- Non-Hamiltonian 3-connected cubic bipartite graphs
- Non-Hamiltonian bicubic graphs
- The ubiquitous Petersen graph
- scientific article; zbMATH DE number 2094531 (Why is no real title available?)
- scientific article; zbMATH DE number 3853111 (Why is no real title available?)
- scientific article; zbMATH DE number 3963871 (Why is no real title available?)
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
This page was built for publication: Cycles through ten vertices in 3-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266024)
