Counting Hamiltonian cycles in planar triangulations
From MaRDI portal
Publication:2131865
DOI10.1016/j.jctb.2022.02.008zbMath1487.05128arXiv2105.07551OpenAlexW3163733193MaRDI QIDQ2131865
Zhiyu Wang, Xingxing Yu, Xiaonan Liu
Publication date: 27 April 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.07551
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)
Cites Work
- The maximum number of minimal codewords in an \([n,k\)-code]
- 4-connected projective planar graphs are Hamiltonian
- Five-connected toroidal graphs are Hamiltonian
- The maximum number of minimal codewords in long codes
- 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
- The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]
- 4-connected projective-planar graphs are Hamiltonian-connected
- Hamilton paths in toroidal graphs
- Hamiltonian circuits in some maps on the torus
- 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
- Hamiltonicity of 5‐Connected Toroidal Triangulations
- Number of Hamiltonian Cycles in Planar Triangulations
- Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators
- A theorem on paths in planar graphs
This page was built for publication: Counting Hamiltonian cycles in planar triangulations