Stable sets in certain P6-free graphs Original Research Article

We provide two polynomial-time exact algorithms to compute a maximum stable set in graphs that are respectively (P6, triangle)-free, and (P6, C4)-free. The algorithm devised for (P6, C4)-free graphs is based on the search of simple augmenting trees and can be extended to heuristically solve the problem in a general graph.