Closed graphs are proper interval graphs
arXiv:1211.5874
Abstract
In this note we prove that every closed graph is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
7 pages