Counting cycles in planar triangulations

DOI10.1016/J.JCTB.2024.10.002MaRDI QIDQ6652098zbMATH OpenFDO

Authors On-Hei S. Lo, Carol T. Zamfirescu

Publication date 12 December 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.10.002

zbMATH Keywords

cycle enumerationplanar triangulation

Mathematics Subject Classification ID

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

Recommendations

• Counting Hamiltonian cycles in planar triangulations
• Number of Hamiltonian cycles in planar triangulations
• On the number of Hamiltonian cycles in triangulations
• Cycles in 5-connected triangulations
• On the number of Hamiltonian cycles in triangulations with few separating triangles

Cites work

• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• 4-connected polyhedra have at least a linear number of Hamiltonian cycles
• 4-connected projective planar graphs are Hamiltonian
• A theorem on graphs.
• A Theorem on Planar Graphs
• Counting Hamiltonian cycles in planar triangulations
• Cycles in 5-connected triangulations
• Distribution of subtree sums
• Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
• Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
• Long cycles in 3-connected graphs
• Long cycles in 3‐connected graphs in orientable surfaces
• Long cycles in 4-connected planar graphs
• Number of Hamiltonian cycles in planar triangulations
• On Hamilton cycles in certain planar graphs
• On the number of cycles of length 4 in a maximal planar graph
• On the number of cycles of lengthk in a maximal planar graph
• On the number of hamiltonian cycles in a maximal planar graph
• On the number of Hamiltonian cycles in triangulations
• On the number of Hamiltonian cycles in triangulations with few separating triangles
• Polyhedra with few 3-cuts are Hamiltonian
• Simple paths on polyhedra
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Subgraph densities in a surface
• The maximum number of pentagons in a planar graph

Cited in

(3)

• Domination of triangulated discs and maximal outerplanar graphs
• Plane triangulations without large 2-trees
• A note on cycles in cyclically 4-edge-connected cubic planar graphs

This page was built for publication: Counting cycles in planar triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652098)