Some results on maximum stable sets in certain P5-free graphs

Authors:
Raffaele Mosca
Affiliations:
Dipartimento di Scienze, Università degli Studi "G. D'Annunzio", Viale Pindaro 42, Pescara 65127, Italy
Venue:
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Year:
2003

Citing 9
Cited 11

On diameters and radii of bridged graphs

Discrete Mathematics
A characterization of graphs without long induced paths

Journal of Graph Theory
On graphs without P5 and P¯5

Discrete 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
A note on &agr;-redundant vertices in graphs

Discrete Applied Mathematics
On (P5, diamond)-free graphs

Discrete Mathematics
Irredundance perfect and P6-free graphs

Journal of Graph Theory

Finding augmenting chains in extensions of claw-free graphs

Information Processing Letters
Some results on graphs without long induced paths

Information Processing Letters
On the structure and stability number of P5- and co-chair-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure of (P5,gem)-free graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
New applications of clique separator decomposition for the Maximum Weight Stable Set problem

Theoretical Computer Science
Maximum independent sets in subclasses of P5-free graphs

Information Processing Letters
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
On the structure of (P5,gem)-free graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
First-Fit coloring of {P5,K4-e}-free graphs

Discrete Applied Mathematics
New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce some large classes of P5-free graphs for which the maximum stable set problem can be efficiently solved. The solution algorithms are based on the search of augmenting vertices. Then a method for extending some of them to the weighted case is provided.