Maximum independent sets in subclasses of P5-free graphs

[1]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

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

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

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

[5]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[6]  Dominique de Werra,et al.  Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[7]  Martin Farber,et al.  On diameters and radii of bridged graphs , 1989, Discret. Math..

[8]  Frederic Maire,et al.  On graphs without P5 and P5_ , 1995, Discret. Math..

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

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

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

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

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

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

[15]  Andreas Brandstädt,et al.  On the structure and stability number of P5- and co-chair-free graphs , 2003, Discret. Appl. Math..

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

[17]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

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

[19]  Vadim V. Lozin,et al.  Finding augmenting chains in extensions of claw-free graphs , 2003, Inf. Process. Lett..

[20]  Alain Hertz,et al.  P5-free augmenting graphs and the maximum stable set problem , 2002, Discret. Appl. Math..

[21]  Vadim V. Lozin,et al.  An augmenting graph approach to the stable set problem in P5-free graphs , 2003, Discret. Appl. Math..

[22]  V. E. Alekseev,et al.  Polynomial algorithm for finding the largest independent sets in graphs without forks , 2004, Discret. Appl. Math..

[23]  Vadim V. Lozin,et al.  Independent sets in extensions of 2K2-free graphs , 2005, Discret. Appl. Math..

[24]  V. Lozin,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA 2006.

[25]  Raffaele Mosca.  Some observations on maximum weight stable sets in certain P , 2008, Eur. J. Oper. Res..