P6- and triangle-free graphs revisited: structure and bounded clique-width

Abstract : The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well-known to be NP-complete for triangle-free graphs, and Mosca has shown that it is solvable in polynomial time when restricted to P6- and triangle-free graphs. We give a complete structure analysis of (nonbipartite) P6- and triangle-free graphs which are prime in the sense of modular decomposition. It turns out that the structure of these graphs is extremely simple implying bounded clique-width and thus, efficient algorithms exist for all problems expressible in terms of Monadic Second Order Logic with quantification only over vertex predicates. The problems Vertex Cover, MWS, Maximum Clique, Minimum Dominating Set, Steiner Tree, and Maximum Induced Matching are among them. Our results improve the previous one on the MWS problem by Mosca with respect to structure and time bound but also extends a previous result by Fouquet, Giakoumakis and Vanherpe which have shown that bipartite P6-free graphs have bounded clique-width. Moreover, it covers a result by Randerath, Schiermeyer and Tewes on polynomial time 3-colorability of P6- and triangle-free graphs.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2006, 8, pp.173-188
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00961108
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 19 mars 2014 - 14:31:12
Dernière modification le : mercredi 29 novembre 2017 - 10:26:24
Document(s) archivé(s) le : jeudi 19 juin 2014 - 11:58:58

Fichier

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

Identifiants

  • HAL Id : hal-00961108, version 1

Collections

Citation

Andreas Brandstädt, Tilo Klembt, Suhail Mahfud. P6- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2006, 8, pp.173-188. 〈hal-00961108〉

Partager

Métriques

Consultations de la notice

213

Téléchargements de fichiers

243