On the independence number of a graph in terms of order and size

Discrete Mathematics

Volumn 232, Issue 1-3, 2001, Pages 131-138

  Harant, J ^a   Schiermeyer, I ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

Independence; Stability

Indexed keywords

EID: 0035815449     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00298-3     Document Type: Article

References (6)

1. Y. Caro, New results on the independence number, Technical Report, Tel-Aviv University, 1979.
2. Y. Caro, Z. Tuza, Improved lower bounds on k-independence, J. Graph Theory 15 (1991) 99-107.
3. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
4. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
5. O. Murphy, Lower bounds on the stability number of graphs computed in terms of degrees, Discrete Math. 90 (1991) 207-211.
6. V.K. Wei, A lower bound on the stability number of a simple graph, Bell Laboratories Technical Memorandum 81-11217-9, Murray Hill, NJ, 1981.