Hamiltonian Cycle Problem on Distance-Hereditary Graphs
Ruo-Wei Hung, Shaur-Ching Wu, Maw‐Shang Chang · 2003
A connected graph G =(V, E) is called distance-hereditary if every two vertices in V have the same distance in every connected induced subgraph of G containing them. This paper presents an O(|V | 2) time algorithm for solving the Hamiltonian cycle problem on distance-hereditary graphs.