On the number of vertices belonging to all maximum stable sets of a graph

Discrete Applied Mathematics

Volumn 124, Issue 1-3, 2002, Pages 17-25

  Boros, Endre ^a   C Golumbic, Martin ^b   E Levit, Vadim ^c  

^a RUTGERS UNIVERSITY   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

^c HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867936915     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00327-4     Document Type: Article

References (8)

1. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
2. M. Grotschel, L. Lovasz, and A. Schrijver The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 1981 169 197
3. G. Gunther, B. Hartnell, and D.F. Rall Graphs whose vertex independence number is unaffected by a single edge addition or deletion Discrete Appl. Math. 46 1993 167 172
4. P. Hall On representatives of subsets J. London Math. Soc. 10 1935 26 30
5. P.L. Hammer, P. Hansen, and B. Simeone Vertices belonging to all or to no maximum stable sets of a graph SIAM J. Algebraic Discrete Methods 3 1982 511 522
6. V.E. Levit, E. Mandrescu, Combinatorial properties of the family of maximum stable sets of a graph, Los Alamos Archive, prE-print math.CO/9912047 (1999) 13pp.
7. V.E. Levit, E. Mandrescu, Maximum stable sets and pendant vertices in trees, Los Alamos Archive, prE-print math.CO/9912048 (1999) 10pp.
8. J. Zito The structure and maximum number of maximum independent sets in trees J. Graph Theory 15 1991 207 221