Stability number in subclasses of \(P_5\)-free graphs
The stability number or independence number of a graph \(G\) is the maximum cardinality among the independent sets of vertices of \(G\). The authors present two new hereditary classes of \(P_5\)-free graphs where the stability number can be found in polynomial time. These results generalize several known ones.
scientific article; zbMATH DE number 2138461