On the stability number of claw-free P5-free and more general graphs

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 163-167

  Brandstädt, Andreas ^a   Hammer, Peter L ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Claw free graphs; Independence number; Polynomial time algorithm; Simplicial vertices; Stability number

Indexed keywords

EID: 0043280991     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00072-4     Document Type: Article

References (7)

1. C. De Simone, A. Sassano, Stability number of bull- and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
2. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
3. P.L. Hammer, N.V.R. Mahadev, D. De Werra, The struction of a graph: Application to CN-free graphs, Combinatorica 5 (1985) 141-147.
4. L. Lovász, M. Plummer, Matching theory, Ann. Discrete Math. 29 (1986).
5. G.M. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory Ser. B 28 (1980) 284-304.
6. D.J. Rose, R.E. Tarjan, G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
7. N. Sbihi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76.