Cycles through 23 vertices in 3-connected cubic planar graphs
From MaRDI portal
Publication:1961756
DOI10.1007/s003730050046zbMath0957.05064OpenAlexW1976057759MaRDI QIDQ1961756
Sheng Bau, Brendan D. McKay, R. E. L. Aldred, Derek Holton
Publication date: 30 January 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050046
Related Items (5)
A twelve vertex theorem for 3-connected claw-free graphs ⋮ Circumference of 3-connected cubic graphs ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ The Parameterized Complexity of Graph Cyclability
Uses Software
This page was built for publication: Cycles through 23 vertices in 3-connected cubic planar graphs
