On certain Hamiltonian inner triangulations (Q2367404)

An inner triangulation is a 2-connected planar graph all of whose interior faces are triangles. Some such graphs have the property of being simply-nested; that is, their vertices can be partitioned into nested cycles or nested cycles culminating in a tree. Presented is an algorithm, with its implementation, for finding a Hamiltonian cycle in a simply- nested inner triangulation.