Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have