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

DOI10.1137/21M1419556zbMath1492.05082arXiv2104.12481OpenAlexW3157900432WikidataQ114074033 ScholiaQ114074033MaRDI QIDQ5088601

On-Hei S. Lo, Jian Guo Qian

Publication date: 13 July 2022

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

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

zbMATH Keywords

Hamiltonian cycleplanar triangulationprojective planar triangulation

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 (1)

Counting Hamiltonian cycles in planar triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 4-connected projective planar graphs are Hamiltonian
• Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
• 4-connected polyhedra have at least a linear number of Hamiltonian cycles
• Cycles in 5-connected triangulations
• Das Geschlecht des vollständigen paaren Graphen
• A Theorem on Planar Graphs
• 5-Connected Toroidal Graphs are Hamiltonian-Connected
• On the number of hamiltonian cycles in a maximal planar graph
• On the number of cycles of lengthk in a maximal planar graph
• On the number of hamiltonian cycles in triangulations with few separating triangles
• Number of Hamiltonian Cycles in Planar Triangulations
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Polytopes, graphs, and complexes

This page was built for publication: Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators