Any Maximal Planar Graph with Two Separating Triangles Has a Hamilton Path
Shengjia Li · Journal of Shanxi University · 2005
A graph is hamiltonian if it has a hamiltonian cycle.A classical theorem of Whitney indicates that any maximal planar graph with no separatining triangles is hamiltonian.Where a separating triangle is a triangle that removal separates the graph.Chuiyuan Chen proved that any maximal planar graph with only one separating triangle is still hamiltonian.It's proved that any maximal planar graph with two separating triangles has a hamiltonian path.