P5-free augmenting graphs and the maximum stable set problem

The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we first propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied classes.

[1]  Peter L. Hammer,et al.  On the Stability Number of Claw-free P5-free and More General Graphs , 1999, Discret. Appl. Math..

[2]  Vassilis Giakoumakis,et al.  Weighted Parameters in (P5, P5)-free Graphs , 1997, Discret. Appl. Math..

[3]  Raffaele Mosca.  Stable Sets in Certain P6-free Graphs , 1999, Discret. Appl. Math..

[4]  Raffaele Mosca,et al.  On (P5, diamond)-free graphs , 2002, Discret. Math..

[5]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[6]  Martin Charles Golumbic,et al.  Trivially perfect graphs , 1978, Discret. Math..

[7]  Vadim V. Lozin,et al.  Stable sets in two subclasses of banner-free graphs , 2003, Discret. Appl. Math..

[8]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[9]  Raffaele Mosca,et al.  Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs , 1997, Inf. Process. Lett..

[10]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .

[11]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[12]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[13]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[14]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[15]  Gerard J. Chang,et al.  Quasi-threshold Graphs , 1996, Discret. Appl. Math..

[16]  Vadim V. Lozin,et al.  Stability in P5- and banner-free graphs , 2000, Eur. J. Oper. Res..

[17]  Vadim V. Lozin,et al.  A note on alpha-redundant vertices in graphs , 2001, Discret. Appl. Math..

[18]  Vadim V. Lozin,et al.  On the stable set problem in special P5-free graphs , 2003, Discret. Appl. Math..

[19]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[20]  Raffaele Mosca.  Some results on maximum stable sets in certain P5-free graphs , 2003, Discret. Appl. Math..

[21]  Vadim V. Lozin,et al.  Augmenting graphs for independent sets , 2004, Discret. Appl. Math..