English

Hamiltonian-connectedness of triangulations with few separating triangles

Combinatorics 2016-05-05 v1

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 s4s\geq4 there are 3-connected triangulation with ss 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.

Keywords

Cite

@article{arxiv.1605.01231,
  title  = {Hamiltonian-connectedness of triangulations with few separating triangles},
  author = {Nico Van Cleemput},
  journal= {arXiv preprint arXiv:1605.01231},
  year   = {2016}
}

Comments

8 pages, 1 figure