Determining the number of internal stability of a graph

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Addison-Wesley .
   Google Scholar
• Balinski , M.L. . On maximum matching. Minimum covering and their connections . Proceedings of the Princeton Symposium on Mathematical Programming . Edited by: Kuhn , H.W. pp. 303 – 312 . Princeton, N.Y : Princeton University Press .
   Google Scholar
• Beineke , L.W. 1969 . A Survey of Packings and Coverings in Graphs in the Many Facets of Graph Theory , Edited by: Chartrand , G. and kapoor , S. 45 – 53 . Springer-Verlag .
   Google Scholar
• Berge , C. 1973 . Graphs and Hypergraphs , North-Holland .
   Google Scholar
• Burlet , M. and Uhry , J.P. 1981 . Parity Graphs. Mathématiques Appliques et Informatique , Universite Scientifique et Médicale et Institut National Polytechnique de Grenoble . Rapport de Recherche No. 232
   Google Scholar
• Chvátal , V. 1977 . Determining the stability number of a graph . SIAM on Computing , 6 : 643 – 662 .
   Web of Science ®Google Scholar
• Chvátal , V. October 1972 . “ On certain polytopes associated with graphs ” . In Centre de Recherches Mathématique No. 238 , October , Universite de Montreal .
   Google Scholar
• Cook , S. 1970 . The complexity of theorem-proving procedures . Proceedings of the Third ACM Symposium on Theory of Computing . 1970 . pp. 151 – 158 . New York : Association for Computing Machinery .
   Google Scholar
• Fulkerson , D.R. 1972 . Anti-blocking polyhedra . Journal of Combinatorial Theory , 12 : 50 – 71 .
   Google Scholar
• Edmonds , J. 1962 . Covers and packings in a family of sets . Bulletin of the American Mathematical Society , 68 : 494 – 497 .
   Google Scholar
• Harary , F. 1969 . Graph Theory , Addison-Wesley .
   Google Scholar
• Hakimi , S.L. and Frank , H. 1969 . Maximum internally stagle sets of a graph . Journal of Mathematical Analysis and Applications , 3 : 296 – 308 .
   Google Scholar
• Hsu , W. , Ikura , Y. and Nemhauser , G.L. 1981 . A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles . Mathematical Programming , 20 : 225 – 232 .
   Web of Science ®Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . “ Computers and intractability ” . In A Guide to the Theory of NP-Completeness , Freeman .
   Google Scholar
• Garvil , F. 1972 . Algorithms for minimum coloring. Maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph . IAM on Computing , 1 : 180 – 187 .
   Google Scholar
• Garvil , F. 1975 . Algorithms on circular-arc graphs . Networks , 4 : 357 – 369 .
   Google Scholar
• Karp , R. 1972 . Reducibility Among Combinatorial Problems in Complexity of Computer Computations , Edited by: Miller , R.E. and Thatcher , J.W. 85 – 104 . New York : Plenum Press .
   Google Scholar
• Minty , G.J. 1980 . On maximal independent sets of vertices in claw-free graphs . Journal of Combinatorial Theory , (B) 28 : 284 – 304 .
   Web of Science ®Google Scholar
• Nemhauser , G.L. and Trotter , L.E. Jr . 1975 . Vertex packings: Structural properties and Algorithms . Mathematical Programming , 8 : 232 – 248 .
   Web of Science ®Google Scholar
• Padberg , M. 1973 . On the facial structure of set packing polyhedra . Mathematical Programming , 5 : 199 – 216 .
   Google Scholar
• Picard , J.C. and Queyranne , M. 1977 . On the integer-valued variables in the linear vertex packing problem . Mathematical Programming , 12 : 97 – 101 .
   Google Scholar
• Pulleyblank , W.R. 1979 . Minimum node covers and 2-bicritical graphs . Mathematical Programming , 17 : 91 – 103 .
   Google Scholar
• Tarjan , R.E. and Trojanowski , A.E. 1977 . Finding a maximum independent set . SIAM on Computing , 6 : 537 – 546 .
   Google Scholar