Counting Hamiltonian cycles in planar triangulations
Combinatorics
2021-11-23 v2
Abstract
Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every -connected planar triangulation on vertices has at least Hamiltonian cycles, with equality if and only if is a double wheel. In this paper, we show that every -connected planar triangulation on vertices has Hamiltonian cycles. Moreover, we show that if is a -connected planar triangulation on vertices and the distance between any two vertices of degree in is at least , then has Hamiltonian cycles.
Keywords
Cite
@article{arxiv.2105.07551,
title = {Counting Hamiltonian cycles in planar triangulations},
author = {Xiaonan Liu and Zhiyu Wang and Xingxing Yu},
journal= {arXiv preprint arXiv:2105.07551},
year = {2021}
}
Comments
arXiv admin note: text overlap with arXiv:2104.04898