NoteNon-hamiltonian 1-tough triangulations with disjoint separating triangles
Introduction
In this note, a triangulation shall be a plane 3-connected graph in which every face is a triangle. (Triangulations are also known as maximal planar graphs, since the addition of any edge renders the graph non-planar.) For a possibly disconnected graph , denote by the number of connected components of . In a triangulation , a triangle is said to be separating if . For triangles and in the distance between and shall be the number of edges of a shortest path in between and for all possible combinations of and .
Answering a question of Böhme, Harant, and Tkáč [2], Böhme and Harant [1] showed that for any non-negative integer there exists a non-hamiltonian triangulation with seven separating triangles every two of which lie at distance at least . Ozeki and the second author [8] proved that the result holds even if we replace ‘seven’ by ‘six’. We note that no non-hamiltonian triangulation with fewer than six separating triangles is known, while Jackson and Yu [6] showed that every triangulation with at most three separating triangles is hamiltonian. (It was recently proven that this result’s generalisation to polyhedral graphs—where 3-vertex-cuts replace separating triangles—is valid, as well [3].)
Chvátal [4] introduced the toughness of a non-complete graph as The toughness of a complete graph is convened to be . A graph is -tough whenever . Chvátal observed that every hamiltonian graph is -tough [4]. In 1979 he raised the question whether l-toughness is a sufficient condition for a triangulation to be hamiltonian, and Nishizeki settled this by proving that there is a non-hamiltonian 1-tough triangulation [7]. (Dillencourt [5] showed that there exists a smaller such triangulation, namely one of order 15, and Tkáč [10] proved that there exists such a triangulation of order 13, and no smaller one. Tkáč’s triangulation contains seven separating triangles.)
Recently, Ozeki and the second author asked whether there are non-hamiltonian 1-tough triangulations in which every two separating triangles are disjoint, see [8, Remark (a)]. We now answer this question in the affirmative and strengthen Nishizeki’s result.
Section snippets
Result
Theorem There exist infinitely many non-hamiltonian -tough triangulations with pairwise disjoint separating triangles.
For the proof of this theorem we will use the following lemma.
Lemma Let be a graph and . If for a vertex in , the graph is -tough, and if , then does not belong to but all of its neighbours do.Nishizeki [7]
Proof of the Theorem In the first part of the proof, we construct a triangulation with the desired properties, and in the second part we present an infinite family. Consider the circular
Acknowledgements
Fujisawa’s work is supported by the Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research (B) 16H03952 and Grant-in-Aid for Scientific Research (C) 17K05349. Zamfirescu’s research is supported by a Postdoctoral Fellowship of the Research Foundation Flanders (FWO) .
References (10)
- et al.
On hamiltonian cycles in 4- and 5-connected plane triangulations
Discrete Math.
(1998) Tough graphs and hamiltonian circuits
Discrete Math.
(1973)An upper bound on the shortness exponent of 1-tough, maximal planar graphs
Discrete Math.
(1991)A 1-tough nonhamiltonian maximal planar graph
Discrete Math.
(1980)- et al.
Non-hamiltonian triangulations with distant separating triangles
Discrete Math.
(2018)