Closed graphs are proper interval graphs
Combinatorics
2012-11-27 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1211.5874,
title = {Closed graphs are proper interval graphs},
author = {Marilena Crupi and Giancarlo Rinaldo},
journal= {arXiv preprint arXiv:1211.5874},
year = {2012}
}
Comments
7 pages