P 6- and triangle-free graphs revisited: structure and bounded clique-width

P 6- and triangle-free graphs revisited: structure and bounded clique-width

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 P 6- and triangle-free graphs. We give a complete structure anal...

Full description

Bibliographic Details
Main Authors: Andreas Brandstädt, Tilo Klembt, Suhail Mahfud
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2006-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Online Access:http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/511

Similar Items

Similar Items