Hamiltonian cycles in some family of cubic 3-connected plane graphs
From MaRDI portal
Publication:4634564
DOI10.4064/cm7123-9-2017zbMath1405.05096arXiv1608.03105OpenAlexW2963004416MaRDI QIDQ4634564
Publication date: 10 April 2018
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03105
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Barnette's conjecture and the \(H^{+-}\) property
- Non-Hamiltonian cubic planar maps
- On Barnette's conjecture
- Hamiltonian circuits in polytopes with even sided faces
- Longest cycles in generalized Buckminsterfullerene graphs
- B-sets and planar maps
- A class of Hamiltonian polytopes
- Nonhamiltonian 3-Connected Cubic Planar Graphs
- A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian
- Polytopes, graphs, and complexes
- Long cycles in fullerene graphs
- Long cycles in fullerene graphs