Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set

Discrete Mathematics

Volumn 256, Issue 1-2, 2002, Pages 193-201

  Harant, Jochen ^a,b,c   Ryjáček, Zdeněk ^a,b,c   Schiermeyer, Ingo ^a,b,c  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^c TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244435376     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00571-X     Document Type: Article

References (4)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
2. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness. Freemann, San Francisco, 1979.
3. N.V.R. Mahadev, B. Reed, A note on vertex orders for stability number, J. Graph Theory 30 (1999) 113-120.
4. O. Murphy, Lower bounds on the stability number of graphs computed in terms of degrees, Discrete Math. 90 (1991) 207-211.