A lower bound on the independence number of a graph

Discrete Mathematics

Volumn 188, Issue 1-3, 1998, Pages 239-243

  Harant, Jochen ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Independence number; Stability

Indexed keywords

EID: 0003102302     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00048-X     Document Type: Article

References (13)

1. Y. Caro, unpublished.
2. S. Fajtlowicz, On conjectures of Graffiti, preprint.
3. O. Favaron, M. Mahéo, J.-F. Saclé, On the residue of a graph, J. Graph Theory 15 (1991) 39-64.
4. J.R. Griggs, D.J. Kleitman, Independence and the Havel-Hakimi residue, Discrete Math. 127 (1994) 209-212.
5. S.L. Hakimi, On the realizability of a set of integers as degrees of the vertices of a graph, SIAM J. Appl. Math. 10 (1962) 496-506.
6. J. Harant, A. Pruchnewski, M. Voigt, On dominating sets and independent sets of graphs, submitted.
7. V. Havel, A remark on the existence of finite graphs (Czech), Časopis Pěst. Mat 80 (1955) 477-480.
8. T.S. Motzkin, E.G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math. 17 (1965) 533-540.
9. O. Murphy, Lower bounds on the stability number of graphs computed in terms of degrees, Discrete Math. 90 (1991) 207-211.
10. S.M. Selkow, The independence number of graphs in terms of degrees, Discrete Math. 122 (1993) 343-348.
11. S.M. Selkow, A probabilistic lower bound on the independence number of graphs, Discrete Math. 132 (1994) 363-365.
12. E. Triesch, Degree sequences of graphs and dominance order, J. Graph Theory 22 (1996) 89-93.
13. V.K. Wei, A lower bound on the stability number of a simple graph, Bell Laboratories Tech. Memorandum 81-11217-9, Murray Hill, NJ, 1981.