On alpha-redundant vertices in P-5-free graphs
We prove that MAXIMUM STABLE SET can be solved in polynomial time on two new subclasses of P-5-free graphs, extending some known polynomially solvable cases. (C) 2002 Elsevier Science B.V. All rights reserved.
polynomial time maximum stable set problem p-5 -free graphs graph algorithms