Computing independent sets in graphs with large girth
Discrete Applied Mathematics
The complexity of coloring graphs without long induced paths
Acta Cybernetica
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Maximum independent sets in subclasses of P5-free graphs
Information Processing Letters
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
| Hi-index | 0.89 |
We show that, for fixed k, there is a polynomial-time algorithm that finds a maximum (or maximum-weight) stable set in any graph that belongs to the class of k-colorable P"5-free graphs, or, more generally, to the class of P"5-free graphs that contain no clique of size k+1. This is based on the following structural result: every connected k-colorable P"5-free graph has a vertex whose non-neighbors induce a (k-1)-colorable subgraph.