The strong perfect graph conjecture for pan-free graphs
Journal of Combinatorial Theory Series B
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
Information Processing Letters
Weighted parameters in (P5,&Pmacr;5)-free graphs
Discrete Applied Mathematics
On minimal imperfect graphs without induced P5
Proceedings of the third international conference on Graphs and optimization
Stable sets in certain P6-free graphs
Discrete Applied Mathematics
On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Maximum independent sets in subclasses of P5-free graphs
Information Processing Letters
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
| Hi-index | 0.05 |
The complexity status of the stable set problem in the class of P5-free graphs is unknown. In the present paper we study an approach to the problem based on finding augmenting graphs. The main result is that the stable set problem in the class of P5-free graphs is polynomially equivalent to the problem of finding augmenting graphs containing a P4. We apply this result to detect a new infinite family of graph classes where the problem has a polynomial time solution. The new family generalizes several previously known results.