A note on 3-connected cubic planar graphs

DOI10.1016/j.disc.2010.03.010zbMath1222.05122OpenAlexW2033879878MaRDI QIDQ973135

Xiao-Yun Lu

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.010

zbMATH Keywords

Hamiltonianlongest cycleHamilton cyclenon-Hamiltonian3-connected cubic planar graphTutte fragment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

On the circumference of 3-connected cubic triangle-free plane graphs ⋮ Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes ⋮ Distance-two colourings of Barnette graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Long cycles in 3-connected graphs
• Simple paths on polyhedra
• A Theorem on Planar Graphs
• On Hamiltonian Circuits

This page was built for publication: A note on 3-connected cubic planar graphs