Cycles in 5-connected triangulations

DOI10.1016/J.JCTB.2019.04.005zbMath1430.05018OpenAlexW2944255845WikidataQ127945248 ScholiaQ127945248MaRDI QIDQ2284724

Carsten Thomassen, R. E. L. Aldred, Adel N. Alahmadi

Publication date: 15 January 2020

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

Full work available at URL: https://orbit.dtu.dk/en/publications/a2393ae6-8975-4254-9a25-0194117fb837

zbMATH Keywords

cyclesplanar triangulationtriangulation of a surfaceprojective planar triangulation

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (7)

Counting Hamiltonian cycles in planar triangulations ⋮ Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators ⋮ Removal of subgraphs and perfect matchings in graphs on surfaces ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Hamiltonian cycles in 4-connected plane triangulations with few 4-separators ⋮ 4-connected polyhedra have at least a linear number of Hamiltonian cycles ⋮ Number of Hamiltonian Cycles in Planar Triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of minimal codewords in an \([n,k\)-code]
• 4-connected projective planar graphs are Hamiltonian
• On the number of cycles in 3-connected cubic graphs
• Long cycles in graphs on a fixed surface
• The maximum number of minimal codewords in long codes
• The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]
• A Theorem on Planar Graphs
• On the number of hamiltonian cycles in a maximal planar graph
• On certain Hamiltonian cycles in planar graphs
• A theorem on paths in planar graphs

This page was built for publication: Cycles in 5-connected triangulations