Hamiltonian circuits in interval graph generalizations
We consider the problem of finding a Hamiltonian circuit in some classes of intersection graphs which generalize interval graphs. We show that the problem is NP-complete for undirected path graphs (and hence chordal graphs), double interval graphs, and rectangle graphs.
scientific article; zbMATH DE number 4020493
scientific article