论文信息 - On alpha-redundant vertices in P5-free graphs

On alpha-redundant vertices in P5-free graphs

Abstract We prove that Maximum Stable Set can be solved in polynomial time on two new subclasses of P5-free graphs, extending some known polynomially solvable cases.

Andreas Brandstädt | Van Bang Le | Hoàng-Oanh Le

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

[2] Egon Balas,et al. On graphs with polynomially solvable maximum-weight clique problem , 1989, Networks.

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

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