https://hal.inria.fr/hal-00961108Brandstädt, AndreasAndreasBrandstädtInstitut für Informatik [Rostock] - Universität RostockKlembt, TiloTiloKlembtInstitut für Informatik [Rostock] - Universität RostockMahfud, SuhailSuhailMahfudInstitut für Informatik [Rostock] - Universität RostockP6- and triangle-free graphs revisited: structure and bounded clique-widthHAL CCSD2006Maximum Weight Stable Set Problemclique-width of graphsefficient algorithms[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-Méditerranée / I3s, Service Ist2014-03-19 14:31:122018-11-23 15:38:022014-03-19 14:43:22enJournal articleshttps://hal.inria.fr/hal-00961108/document10.46298/dmtcs.372application/pdf1The 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.