On the stable set problem in special P 5-free graphs

Discrete Applied Mathematics

Volumn 125, Issue 2-3, 2003, Pages 215-224

  Gerber, Michael U ^a   Lozin, Vadim V ^a  

^a EPFL   (Switzerland)

Author keywords

Polynomial algorithm; Stability number; Stable set

Indexed keywords

EID: 84867959839     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00321-3     Document Type: Article

References (29)

1. V.E. Alekseev, On the number of maximal stable sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, University of Nizhny Novgorod, 1991, pp. 5-8 (in Russian).
2. V.E. Alekseev, A polynomial algorithm for finding maximum independent sets in fork-free graphs, Discrete Anal. Oper. Res. Ser. 1 6(4) (1999) 3-19 (in Russian).
3. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, combinatorial-algebraic methods in applied mathematics, Gorkiy University, 1983, pp. 3-13 (in Russian).
4. V.E. Alekseev, V.V. Lozin, On local transformations of graphs that preserve the independence number, Discrete Anal. Oper. Res. Ser. 1 5(1) (1998) 3-19 (in Russian).
5. 5, diamond)-free graphs, Research report. Department of Pure and Applied Mathematics, Università di I'Aquila, 1999.
6. 2 Discrete Math. 115 1993 51 55
7. 5-free and more general graphs Discrete Appl. Math. 95 1999 163 167
8. A. Brandstädt, and V.V. Lozin A note on α-redundant vertices in graphs Discrete Appl. Math. 108 2001 301 308
9. V. Chvátal, C.T. Hoang, N.V.R. Mahadev, and D. de Werra Four classes of perfectly orderable graphs J. Graph Theory 11 1987 481 495
10. D.G. Corneil The complexity of generalized clique packing Discrete Appl. Math. 12 1985 233 239
11. D.G. Corneil, Y. Perl, and L.K. Stewart A linear recognition algorithm for cographs SIAM J. Comput. 14 1985 926 934
12. C. de Simone, and A. Sassano Stability number of bull- and chair-free graphs Discrete Appl. Math. 41 1993 121 129
13. M. Farber, M. Hujter, and Zs. Tuza An upper bound on the number of cliques in a graph Networks 23 1993 207 210
14. 5 and P 5 Ann. Discrete Math. 146 1995 33 44
15. 4-sparse graphs Discrete Math. 165-166 1997 277 300
16. M. Grötschel, L. Lovász, and A. Schrijver Polynomial algorithms for perfect graphs Ann. Discrete Math. 21 1984 325 356
17. V. Giakoumakis, and I. Rusu Weighted parameters in (P 5, P 5) -free graphs Discrete Appl. Math. 80 2-3 1997 255 261
18. P.L. Hammer, and B. Simeone Quasimonotone Boolean functions and bistellar graphs Ann. Discrete Math. 9 1980 107 119
19. R.B. Hayward Murky graphs J. Combin. Theory Ser. B 49 1990 200 235
20. A. Hertz Polynomially solvable cases for the maximum stable set problem Discrete Appl. Math. 60 1995 195 210
21. A. Hertz On the use of Boolean methods for the computation of the stability number Discrete Appl. Math. 76 1997 183 203
22. A. Hertz On a graph transformation which preserves the stability number Yugoslav J. Oper. Res. 10/1 2000 1 12
23. 5 and Banner-free graphs European J. Oper. Res. 125 2000 292 297
24. F. Maffray, and M. Preissmann Linear recognition of pseudo-split graphs Discrete Appl. Math. 52 1994 307 312
25. N.V.R. Mahadev, Vertex deletion and stability number, ORWP 90/2, Department of Mathematics, Swiss Federal Institute of Technology, 1990.
26. G.J. Minty On maximal independent sets of vertices in claw-free graphs J. Combin. Theory Ser. B 28 1980 284 304
27. 5-free graphs Inform. Process. Lett. 61 1997 137 143
28. S. Poljak A note on stable sets and coloring of graphs Comment. Math. Univ. Carolinae 15 1974 307 309
29. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa A new algorithm for generating all the maximal independent sets SIAM J. Computing 6 1977 505 517