Highly-connected planar cubic graphs with few or many Hamilton cycles

DOI10.1016/j.disc.2019.111608zbMath1422.05059arXiv1901.10683OpenAlexW2966470250WikidataQ127402667 ScholiaQ127402667MaRDI QIDQ2329193

Irene Pivotto, Gordon F. Royle

Publication date: 17 October 2019

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

Full work available at URL: https://arxiv.org/abs/1901.10683

zbMATH Keywords

cubic graphplanar graphHamilton cyclefullerenenanotubecyclic edge-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Regular Graphs with Few Longest Cycles, Graphs with few hamiltonian cycles, Unnamed Item

Uses Software

• plantri
• GenerateUHG

Cites Work

• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• Infinitely many planar cubic hypohamiltonian graphs of girth 5
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item