Hamiltonian-connectedness of triangulations with few separating triangles
classification
🧮 math.CO
keywords
separatingconnectedhamiltonian-connectedtrianglestriangulationsboundscomputationalform
read the original abstract
We prove that 3-connected triangulations with at most one separating triangle are hamiltonian-connected. In order to show bounds on the strongest form of this theorem, we proved that for any $s\geq4$ there are 3-connected triangulation with $s$ separating triangles that are not hamiltonian-connected. We also present computational results which show that all `small' 3-connected triangulations with at most 3 separating triangles are hamiltonian-connected.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.