Closed graphs are proper interval graphs
Crupi, Marilena · Rinaldo, Giancarlo
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.