1. M.L. Balinski, “On maximum matching, minimum covering and their connections”, in: H. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton NJ, 1970) 303–312.
2. J. Edmonds and E.L. Johnson. “Matching: a well-solved class of integer linear programs”, in:Proceedings of the Calgary international conference on combinatorial structures and their applications (Gordon and Breach, New York, 1970).
3. L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
4. E.L. Johnson, “Programming in networks and graphs”, ORC 65.1, University of California, Berkeley (1965).
5. L.C. Lorentzen, “Notes on covering of arcs by nodes in an undirected graph”, ORC 66.16, University of California, Berkeley (1966).