Zacytuj

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
Język:
Angielski
Częstotliwość wydawania:
Volume Open
Dziedziny czasopisma:
Mathematics, General Mathematics