Cite

Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

eISSN:
1844-0835
Language:
English
Publication timeframe:
Volume Open
Journal Subjects:
Mathematics, General Mathematics