Number of Hamiltonian Cycles in Planar Triangulations

DOI10.1137/20M1366551zbMath1465.05085arXiv2104.04898MaRDI QIDQ4990401

Xingxing Yu, Xiaonan Liu

Publication date: 28 May 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.04898

zbMATH Keywords

Hamiltonian cyclebridgeplanar triangulationTutte path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Counting Hamiltonian cycles in planar triangulations ⋮ Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators

Cites Work

• 4-connected projective planar graphs are Hamiltonian
• Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
• Cycles in 5-connected triangulations
• A Theorem on Planar Graphs
• On the number of hamiltonian cycles in a maximal planar graph
• On certain Hamiltonian cycles in planar graphs
• On the number of hamiltonian cycles in triangulations with few separating triangles
• Hamilton cycles in plane triangulations
• A theorem on paths in planar graphs

This page was built for publication: Number of Hamiltonian Cycles in Planar Triangulations