Accès libre

Closed graphs are proper interval graphs

Marilena Crupi
Marilena Crupi
 et 
Giancarlo Rinaldo
Giancarlo Rinaldo
   | 22 déc. 2015
Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică's Cover Image
À propos de cet article
Article précédent
Article suivant
Citez
Publié en ligne: 22 déc. 2015
Pages: 37 - 44
Reçu: 18 sept. 2013
Accepté: 13 nov. 2013
DOI: https://doi.org/10.2478/auom-2014-0048
Mots clés
© 2014 Marilena Crupi et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

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
Langue:
Anglais
Périodicité:
Volume Open
Sujets de la revue:
Mathematics, General Mathematics
RSS Feed de la revue