Maximum independent sets in subclasses of P5-free graphs

The class of P5-free graphs is the unique minimal class defined by a single connected forbidden induced subgraph for which the complexity status of the maximum independent set problem is unknown. In this paper, we prove polynomial-time solvability of the problem in two subclasses of P5-free graphs generalizing several previously known results.