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

DOI10.1016/j.disc.2020.112126zbMath1454.05067OpenAlexW3083542809MaRDI QIDQ2005718

On-Hei S. Lo

Publication date: 8 October 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112126

zbMATH Keywords

Hamiltonian cycles4-connected plane triangulationscounting base

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

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

Cites Work

• Polyhedra with few 3-cuts are Hamiltonian
• Cycles in 5-connected triangulations
• A Theorem on Planar Graphs
• On the number of hamiltonian cycles in a maximal planar graph
• On the number of hamiltonian cycles in triangulations with few separating triangles
• Hamilton cycles in plane triangulations

This page was built for publication: Hamiltonian cycles in 4-connected plane triangulations with few 4-separators