当前位置: X-MOL 学术J. Comb. Theory B › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Counting Hamiltonian cycles in planar triangulations
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2022-03-07 , DOI: 10.1016/j.jctb.2022.02.008
Xiaonan Liu 1 , Zhiyu Wang 1 , Xingxing Yu 1
Affiliation  

Hakimi, Schmeichel, and Thomassen (1979) [10] conjectured that every 4-connected planar triangulation G on n vertices has at least 2(n2)(n4) Hamiltonian cycles, with equality if and only if G is a double wheel. In this paper, we show that every 4-connected planar triangulation on n vertices has Ω(n2) Hamiltonian cycles. Moreover, we show that if G is a 4-connected planar triangulation on n vertices and the distance between any two vertices of degree 4 in G is at least 3, then G has 2Ω(n1/4) Hamiltonian cycles.



中文翻译:

在平面三角剖分中计算哈密顿循环

Hakimi、Schmeichel 和 Thomassen (1979) [10] 推测,在n个顶点上的每个 4 连通平面三角剖分G至少有2(n-2)(n-4)哈密​​顿循环,当且仅当G是双轮时相等。在本文中,我们证明了在n个顶点上的每个 4 连通平面三角剖分都有Ω(n2)哈密​​顿循环。此外,我们证明如果G是n个顶点上的 4 连通平面三角剖分,并且G中任意两个 4 次顶点之间的距离至少为 3,则G2Ω(n1/4)哈密​​顿循环。

更新日期:2022-03-07
down
wechat
bug