Determining the number of internal stability of a graph
- 1 January 1982
- journal article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 11 (3-4) , 207-220
- https://doi.org/10.1080/00207168208803311
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cyclesMathematical Programming, 1981
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- On the integer-valued variables in the linear vertex packing problemMathematical Programming, 1977
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Maximum internally stable sets of a graphJournal of Mathematical Analysis and Applications, 1969
- Covers and packings in a family of setsBulletin of the American Mathematical Society, 1962