1. J. Edmonds and E. L. Johnson, ?Matching: A Well-Solved Class of Integer Linear Programs,? in: Combinatorial Structures and Their Applications, Gordon and Breach, New York (1970), pp. 89?92.
2. M. Gary and D. Johnson, Computers and Intractability [Russian translation], Mir, Moscow (1982).
3. L. G. Khachiyan, ?Matchings of given weight in bipartite graphs,? in: Methods and Programs for the Solution of Optimization Problems on Graphs and Networks, abstracts of papers at the 3rd All-Union Conf. (Aug. 1984, Tashkent) [in Russian], Part 2, VTs SO AN SSSR (1984).
4. O. Ore, Theory of Graphs, Am. Math. Soc. (1974).
5. A. V. Karzanov, ?An exact bound for the maximum flow algorithm applied to the problem of set representatives,? Voprosy Kibernetiki, No. 1, 66?70 (1973).