Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- 1 December 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (4) , 511-522
- https://doi.org/10.1137/0603052
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Minimum node covers and 2-bicritical graphsMathematical Programming, 1979
- Packing Problems and Hypergraph Theory: A SurveyAnnals of Discrete Mathematics, 1979
- Regularisable graphs, IIDiscrete Mathematics, 1978
- Regularisable graphs IDiscrete Mathematics, 1978
- On the integer-valued variables in the linear vertex packing problemMathematical Programming, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Minimax theorems for hypergraphsPublished by Springer Nature ,1974
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952