Closed graphs are proper interval graphs
classification
🧮 math.CO
cs.DM
keywords
closedgraphgraphsintervalproperalgorithmsconsequenceevery
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.