Covering, Packing and Generalized Perfection
- 1 January 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (1) , 109-132
- https://doi.org/10.1137/0606012
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network StructureManagement Science, 1983
- On the perfect graph conjectureDiscrete Mathematics, 1976
- R -Domination in GraphsJournal of the ACM, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- On balanced matricesPublished by Springer Nature ,1974
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Balanced matricesMathematical Programming, 1972