Characterizing path graphs by forbidden induced subgraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Graph Theory Année : 2009

Characterizing path graphs by forbidden induced subgraphs

Frédéric Maffray
Myriam Preissmann

Résumé

A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are not path graphs and are minimal with this property.
Fichier principal
Vignette du fichier
pathgraphs.pdf (212.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00261413 , version 1 (06-03-2008)
hal-00261413 , version 2 (12-03-2008)
hal-00261413 , version 3 (17-04-2008)

Identifiants

Citer

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann. Characterizing path graphs by forbidden induced subgraphs. Journal of Graph Theory, 2009, 62 (4), pp.369-384. ⟨10.1002/jgt.20407⟩. ⟨hal-00261413v3⟩
270 Consultations
565 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More