Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
On-Hei Solomon Lo, Jianguo Qian

TL;DR
This paper proves that 4-connected planar and projective planar triangulations with a linear number of 4-separators have exponentially many hamiltonian cycles, extending previous quadratic bounds.
Contribution
It strengthens existing results by showing exponential lower bounds on hamiltonian cycles in such triangulations with few 4-separators.
Findings
Exponential number of hamiltonian cycles in 4-connected planar triangulations with O(n) 4-separators.
Extension of previous quadratic bounds to exponential bounds.
Application to projective planar triangulations.
Abstract
Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later in 1979, Hakimi, Schmeichel and Thomassen conjectured that every such triangulation on vertices has at least hamiltonian cycles. Along this direction, Brinkmann, Souffriau and Van Cleemput established a linear lower bound on the number of hamiltonian cycles in 4-connected planar triangulations. In stark contrast, Alahmadi, Aldred and Thomassen showed that every 5-connected triangulation of the plane or the projective plane has exponentially many hamiltonian cycles. This gives the motivation to study the number of hamiltonian cycles of 4-connected triangulations with few 4-separators. Recently, Liu and Yu showed that every 4-connected planar triangulation with 4-separators has a quadratic number of hamiltonian cycles. By adapting the framework of Alahmadi et al.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
