1. E. Balas and H. Samuelsson, “Finding a minimum node cover in an arbitrary graph”, Management Sciences Research Rept. No. 325, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa. (November 1973).
2. M.L. Balinski, “On maximum matching, minimum covering and their connections”, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming, (Princeton University Press, Princeton, N.J., 1970) pp. 303–312.
3. C. Berge,The theory of graphs and its applications (Methuen, London, 1962).
4. V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques-238, Université de Montréal (October 1972).
5. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 5 (1973) 305–337.