Stable sets in certain P6-free graphs

Discrete Applied Mathematics

Volumn 92, Issue 2-3, 1999, Pages 177-191

  Mosca, Raffaele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Computational complexity; The maximum stable set problem

Indexed keywords

EID: 0038290872     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00046-3     Document Type: Article

References (18)

1. 5- and diamond free graphs, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tecnical Report n. 79, February 1995.
2. G. Bacsò, Z.S. Tuza, Dominating cliques in P5-free graphs, Period. Math. Hungar. 21 (4) (1990) 308-315.
3. G. Bacsò, Z.S. Tuza, A characterization of graphs without long induced paths, J. Graph Theory 14 (4) (1990) 455-464.
4. C. De Simone, A. Sassano, Stability number of bull and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
5. J.F. Desler, S.L. Hakimi, On finding a maximum stable set of a graph, Proceedings of the Fourth Annual Princeton Conference on Information Science and Systems, Princeton, NJ, 1970.
6. 5, Discrete Math. 146 (1995) 33-44.
7. M.R. Garey, D.S. Johnson, The rectilinear steiner tree problem is NP-complete, SIAM J. Appl. Math. 32 (1977) 826-834.
8. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
9. M.C. Golumbic, The complexity of comparability graph recognition and coloring, Computing 18 (1977) 199-208.
10. M.C. Golumbic, Algorithmic aspects of perfect graphs, Ann. Discrete Math. 21 (1984) 301-323.
11. M. Groetschel, L. Lovàsz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
12. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
13. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory (B) 28 (1980) 284-304.
14. 5-free graphs, Inform. Process. Lett. 61 (1997).
15. 5-free graphs, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tecnical Report, April 1998.
16. S. Olariu, Paw-free Graphs, Inform. Process. Lett. 28 (1988) 53-54.
17. S. Poljak, A note on stable set and colorings of graphs, Comment. Math. Univ. Carolina 15 (1974) 307-309.
18. N. Shibi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76.