Stable sets for (P_{6}, K_{2,3})-free graphs
Raffaele Mosca · Discussiones Mathematicae Graph Theory · 2012
The Maximum Stable Set (MS) problem is a well known NP-hard problem.However different graph classes for which MS can be efficiently solved have been detected and the augmenting graph technique seems to be a fruitful tool to this aim.In this paper we apply a recent characterization of minimal augmenting graphs [22] to prove that MS can be solved for (P 6 ,K 2,3 )-free graphs in polynomial time, extending some known results.