Recognizing the P_4-structure of claw-free graphs and a larger graph class

Abstract : The P_4-structure of a graph G is a hypergraph \textbfH on the same vertex set such that four vertices form a hyperedge in \textbfH whenever they induce a P_4 in G. We present a constructive algorithm which tests in polynomial time whether a given 4-uniform hypergraph is the P_4-structure of a claw-free graph and of (banner,chair,dart)-free graphs. The algorithm relies on new structural results for (banner,chair,dart)-free graphs which are based on the concept of p-connectedness. As a byproduct, we obtain a polynomial time criterion for perfectness for a large class of graphs properly containing claw-free graphs.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.127-146
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00958979
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 16:55:53
Dernière modification le : mercredi 29 novembre 2017 - 10:26:17
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:07:39

Fichier

dm050109.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958979, version 1

Collections

Citation

Luitpold Babel, Andreas Brandstädt, Van Bang Le. Recognizing the P_4-structure of claw-free graphs and a larger graph class. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.127-146. 〈hal-00958979〉

Partager

Métriques

Consultations de la notice

49

Téléchargements de fichiers

127