Finding Hamiltonian circuits in interval graphs (Q1066674): Difference between revisions

The problem of deciding whether a graph has a Hamiltonian circuit has been shown NP-complete on many restricted classes of graphs. This paper adds to the classes of graphs for which a polynomial time algorithm for the Hamiltonian circuit problem is known. A linear time algorithm for the problem in interval graphs is developed.