4-connected polyhedra have at least a linear number of Hamiltonian cycles
DOI10.1016/J.EJC.2021.103395zbMATH Open1469.05097OpenAlexW3178022067WikidataQ114184727 ScholiaQ114184727MaRDI QIDQ2048366FDOQ2048366
Authors: Gunnar Brinkmann, Nico Van Cleemput 
Publication date: 5 August 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103395
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- House of Graphs: a database of interesting graphs
- A Theorem on Planar Graphs
- A theorem on paths in planar graphs
- Hamilton cycles in plane triangulations
- Polyhedra with few 3-cuts are Hamiltonian
- On the number of hamiltonian cycles in a maximal planar graph
- On the number of Hamiltonian cycles in triangulations with few separating triangles
- On Hamilton cycles in certain planar graphs
- Cycles in 5-connected triangulations
Cited In (7)
- Regular graphs with few longest cycles
- Counting cycles in planar triangulations
- Counting Hamiltonian cycles in planar triangulations
- Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
- Hamiltonian cycles and 1-factors in 5-regular graphs
- \(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles
Uses Software
This page was built for publication: 4-connected polyhedra have at least a linear number of Hamiltonian cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048366)
