Hamiltonian-connectedness of triangulations with few separating triangles

DOI10.11575/cdm.v14i1.62582zbMath1444.05084arXiv1605.01231OpenAlexW2998864474MaRDI QIDQ3299370

Nicolas Van Cleemput

Publication date: 22 July 2020

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

zbMATH Keywords

triangulationmaximal planar graphdecomposition treeHamiltonian connectedness

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Scattering number and extremal non-Hamiltonian graphs
• On a class of posets and the corresponding comparability graphs
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
• Hamilton cycles in plane triangulations
• A theorem on paths in planar graphs

This page was built for publication: Hamiltonian-connectedness of triangulations with few separating triangles