In this article, we investigate hamiltonian cycles in plane triangulations. The aim of the article is to find the strongest possible form of Whitney's theorem about hamiltonian triangulations in terms of the decomposition tree defined by separating triangles. We will decide on the existence of nonhamiltonian triangulations with given decomposition trees for all trees except trees with exactly one vertex with degree k{4,5} and all other degrees at most 3. For these cases, we show that it is sufficient to decide on the existence of nonhamiltonian triangulations with decomposition tree K-1,K- 4 or K-1,K- 5. We also give computational results on the size of a possible minimal nonhamiltonian triangulation with these decomposition trees.
[1]
Hadrien Mélot,et al.
House of Graphs: A database of interesting graphs
,
2012,
Discret. Appl. Math..
[2]
Vasek Chvátal,et al.
Tough graphs and hamiltonian circuits
,
1973,
Discret. Math..
[3]
H. Whitney.
A Theorem on Graphs
,
1931
.
[4]
Bill Jackson,et al.
Hamilton cycles in plane triangulations
,
2002,
J. Graph Theory.
[5]
B. McKay,et al.
Fast generation of planar graphs
,
2007
.
[6]
Chiuyuan Chen.
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian
,
2003,
J. Comb. Optim..