Closed graphs are proper interval graphs
  In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition. 
Marilena Crupi, Giancarlo Rinaldo
math.CO cs.DM