JOURNAL ARTICLE

Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators

On‐Hei Solomon LoJianguo Qian

Year: 2022 Journal:   SIAM Journal on Discrete Mathematics Vol: 36 (2)Pages: 1496-1501   Publisher: Society for Industrial and Applied Mathematics

Abstract

Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later, Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every such triangulation on $n$ vertices has at least $2(n - 2)(n - 4)$ hamiltonian cycles. Along this direction, Brinkmann, Souffriau, and Van Cleemput in 2018 established a linear lower bound on the number of hamiltonian cycles in 4-connected planar triangulations. In stark contrast, Alahmadi, Aldred, and Thomassen in 2020 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 in 2021 showed that every 4-connected planar triangulation with $O(n / \log n)$ 4-separators has a quadratic number of hamiltonian cycles. By adapting the framework of Alahmadi, Aldred, and Thomassen, we strengthen the last two aforementioned results. We prove that every 4-connected planar or projective planar triangulation with $O(n)$ 4-separators has exponentially many hamiltonian cycles.

Keywords:
Mathematics Hamiltonian (control theory) Planar Combinatorics Projective plane Triangulation Hamiltonian path Discrete mathematics Geometry Computer science

Metrics

2
Cited By
0.53
FWCI (Field Weighted Citation Impact)
20
Refs
0.54
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

Hamiltonian cycles in 4-connected plane triangulations with few 4-separators

On‐Hei Solomon Lo

Journal:   Discrete Mathematics Year: 2020 Vol: 343 (12)Pages: 112126-112126
JOURNAL ARTICLE

4-connected projective-planar graphs are Hamiltonian-connected

Ken‐ichi KawarabayashiKenta Ozeki

Journal:   Journal of Combinatorial Theory Series B Year: 2014 Vol: 112 Pages: 36-69
JOURNAL ARTICLE

4-connected projective-planar graphs are hamiltonian-connected

Ken‐ichi KawarabayashiKenta Ozeki

Journal:   Symposium on Discrete Algorithms Year: 2013 Pages: 378-395
JOURNAL ARTICLE

4-Connected Projective-Planar Graphs Are Hamiltonian

Robin ThomasXingxing Yu

Journal:   Journal of Combinatorial Theory Series B Year: 1994 Vol: 62 (1)Pages: 114-132
© 2026 ScienceGate Book Chapters — All rights reserved.