Stability in P5- and banner-free graphs

European Journal of Operational Research

Volumn 125, Issue 2, 2000, Pages 292-297

  Lozin, V V ^a  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

POLYNOMIAL ALGORITHMS; STABLE SETS;

OPERATIONS RESEARCH;

EID: 0033691672     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00460-9     Document Type: Article

References (23)

1. 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 Publishers, Gorkiy, 1983, pp. 3-13 (in Russian).
2. V.E. Alekseev, On the number of deadlock (maximal) independent sets in graphs from hereditary classes, Combinatorial-Algebraic Meth. Discrete Optim., Nizhny Novgorod University Publishers, Nizhniy Novgorod, 1991, pp. 5-8 (in Russian).
3. V.E. Alekseev, V.V. Lozin, On local transformations of graphs preserving the independence number, Discrete Analysis and Operations Research 5 (1) (1998) 3-19 (in Russian).
4. 5 , diamond)-free graphs, Technical Report No. 79, Università di L'Aquila, Dipartimento di Matematica Pure e Applicata, 1995.
5. 2 Discrete Mathematics. 115:1993;51-55.
6. 5 -free and more general graphs, RUTCOR Research Report 27-97, Rutgers University, New Brunswick, NJ, 1997.
7. Chvátal V., Hammer P.L. Aggregation of inequalities in integer programming. Annals of Discrete Mathematics. 1:1973;145-162.
8. Corneil D.G., Lerchs H., Stewart Birlingham L. Complement reducible graphs. Discrete Applied Mathematics. 41:1993;121-129.
9. De Simone C., Sassano A. Stability number of bull- and chair-free graphs. Discrete Applied Mathematics. 41:1993;121-129.
10. S. Foldes, P.L. Hammer, Split graphs, in: Proceedings of Eighth South-Eastern Conference on Combinatorics, Graph Theory and Computing, 1977, pp. 311-315.
11. 4 -semi sparse graphs Discrete Mathematics. 165/166:1997;277-300.
12. 5 Discrete Mathematics. 146:1995;33-44.
13. Grötschel M., Lovász L., Schrijver A. Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics. 21:1984;325-356.
14. P.L. Hammer, A. Hertz, On a transformation which preserves the stability number, RUTCOR Research Report 69-91, Rutgers University, New Brunswick, NJ, 1991.
15. Hertz A. Polynomially solvable cases for the maximum stable set problem. Discrete Applied Mathematics. 60:1995;195-210.
16. Hertz A. On the use of Boolean methods for the computation of the stability number. Discrete Applied Mathematics. 76:1997;183-203.
17. F. Maffray, M. Preismann, Linear regognition of pseudo-split graphs, Research Report LSD2-ARTEMIS, Université J. Fourier, Grenoble, France, 1993.
18. N.V.R. Mahadev, Vertex deletion and stability number, Research report ORWR 90/2, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, 1990.
19. M.R. McConnel, J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, VA, 1994, pp. 536-544.
20. Minty G.J. On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory B. 28:1980;284-304.
21. 5 -free graphs Information Processing Letters. 61:1997;137-144.
22. Sbihi N. Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile. Discrete Mathematics. 29:1980;53-76.
23. Tsukigama S., Ide M., Ariochi H., Ozaki H. A new algorithm for generating all the maximal independent sets. SIAM Journal of Computing. 6(3):1977;503-517.