P5-free augmenting graphs and the maximum stable set problem

Discrete Applied Mathematics

Volumn 132, Issue 1-3, 2003, Pages 109-119

  Gerber, Michael U ^a   Hertz, Alain ^b   Schindl, David ^a  

^a EPFL   (Switzerland)

^b GERAD   (Canada)

Author keywords

Augmenting graphs; Polynomial algorithm; Stable set

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

AUGMENTING GRAPHS;

GRAPH THEORY;

EID: 0142061478     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00394-9     Document Type: Conference Paper

References (23)

1. V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, Combinatorial-algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorkiy, 1991, pp. 5-8 (in Russian).
2. V.E. Alekseev, A polynomial algorithm for finding largest independent sets in fork-free graphs, Diskretn. Anal. Issled. Oper. Ser. 1(6) (1999) 3-19 (in Russian).
3. V.E. Alekseev, V.V. Lozin, Augmenting graphs for independent sets, Discrete Appl. Math., to appear.
4. 5, diamond)-free graphs, Research Report (1999), Department of Pure and Applied Mathematics, University of Aquila.
5. 5 -free and more general graphs Discrete Appl. Math. 95:1999;163-167.
6. Brandstädt A., Lozin V.V. A note on. α -redundant vertices in graphs Discrete Appl. Math. 108:2001;301-308.
7. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
8. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:1976;237-267.
9. 5 -free graphs Discrete Appl. Math. 125:2003;215-224.
10. M.U. Gerber, A. Hertz, V.V. Lozin, Stable sets in two subclasses of banner-free graphs, Discrete Appl. Math., this issue.
11. 5̄) -free graphs Discrete Appl. Math. 80:1997;255-261.
12. Golumbic M.C. Trivially perfect graphs. Discrete Math. 24:1978;105-107.
13. 5 and banner-free graphs European J. Oper. Res. 125:2000;292-297.
14. McConnell R.M., Spinrad J.P. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
15. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B. 28:1980;284-304.
16. 5 -free graphs Inform. Proc. Lett. 61:1997;137-144.
17. 6 -free graphs Discrete Appl. Math. 92:1999;177-191.
18. 5 -free graphs, unpublished manuscript, Universita degli Studi di L'Aqila, Italy (1999).
19. Poljak S. A note on stable sets and coloring of graphs. Comment. Math. Univ. Carolinae. 15:1974;307-309.
20. N. Sbihi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76 (in French).
21. 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.
22. Yan J.-H., Chen J.-J., Chang G.J. Quasi-threshold graphs. Discrete Appl. Math. 69:1996;247-255.
23. Yannakakis M. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods. 3:1982;351-358.