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

Discrete Applied Mathematics

Volumn 132, Issue 1-3, 2003, Pages 175-183

  Mosca, Raffaele ^a  

^a UNIVERSITY OF CHIETI   (Italy)

Author keywords

Computational complexity; Stable set

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

STABLE SETS;

GRAPH THEORY;

EID: 0142093028     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00399-8     Document Type: Conference Paper

References (21)

1. V.E. Alekseev, On the local restiction effect on the complexity of finding the graph independence number, Combinatorial Algebraic Methods in Applied Mathematics, Gorkiy University, 1983, pp. 3-13.
2. Alekseev V.E. A polynomial algorithm for finding maximum independent sets in fork-free graphs. Discrete Anal. Oper. Res. Ser. 1. 6(4):1999;3-19.
3. 5, diamond)-free graphs Discrete Math. 250:2002;1-22.
4. 5-free graphs Period. Math. Hungar. 21(4):1990;308-315.
5. Bacsò G., Tuza Z.S. A characterization of graphs without long induced paths. J. Graph Theory. 14:1990;455-464.
6. 5 Discrete Appl. Math. 94:1999;9-33.
7. 5, diamond)-free graphs revisited: structure and linear optimization, manuscript 2000.
8. 5-free and more general graphs Discrete Appl. Math. 95:1999;163-167.
9. 5, gem)-free graphs, to appear.
10. Brandstädt A., Lozin V.V. A note on the. α-redundant vertices in graphs Discrete Appl. Math. 108:2001;301-308.
11. 5- and co-chair-free graphs, this issue.
12. Farber M. On the diameters and radii of bridged graphs. Discrete Math. 73:1989;249-260.
13. 5 Discrete Math. 146:1995;33-44.
14. 5 )-free graphs Discrete Appl. Math. 80:1997;255-261.
15. 5- and banner-free graphs European J. Oper. Res. 125:2000;292-297.
16. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory B. 28:1980;284-304.
17. 5-free graphs Inform. Process. Lett. 61:1997;137-143.
18. 6-free graphs J. Graph Theory. 29:1998;239-255.
19. Shibi N. Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29:1980;53-76.
20. Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6:1977;505-517.
21. Yannakakis M. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods. 3:1982;351-358.