Some results on maximum stable sets in certain P5-free graphs Original Research Article

We introduce some large classes of P5-free graphs for which the maximum stable set problem can be efficiently solved. The solution algorithms are based on the search of augmenting vertices. Then a method for extending some of them to the weighted case is provided.