2012/11/26 by Crupi, Marilena, Rinaldo, Giancarlo · 1 citation
#05E40 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1211.5874
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.