Each maximal planar graph with exactly two separating triangles is Hamiltonian

Guido Helden
2007 Discrete Applied Mathematics  
A classical result of Whitney states that each maximal planar graph without separating triangles is Hamiltonian, where a separating triangle is a triangle whose removal separates the graph. Chen [Any maximal planar graph with only one separating triangle is Hamiltonian J. Combin. Optim. 7 (2003) 79-86] proved that any maximal planar graph with only one separating triangle is still Hamiltonian. In this paper, it is shown that the conclusion of Whitney's Theorem still holds if there are exactly two separating triangles.
doi:10.1016/j.dam.2007.03.018 fatcat:npbltdz3lrao5aewhboeeu7l4i