1. Aho A. V., Hopcroft J. E, Ullman J. D: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974, 187–189.
2. Balinski M. L.: Labelling to Obtain a Maximum Matching, in Combinatorial Mathematics and its Applications (R. C. Bose and T. A. Dowling, eds.), University of North Carolina Press, Chapel Hill, 1969, 585–602.
3. Bartnik G.W.: Algorithmes de couplages dans les graphes, Thése Doctorat 3e cycle, Université Paris VI,1978.
4. Berge C.: Two Theorems in Graph Theory, Proc. Nat. Acad. Sci. U.S.A., 43 (1957), 449–844.
5. Blum N.: A New Approach to Maximum Matching in General Graphs, Report No. 8546-CS, Institut für Informatik der Universität Bonn, Mai 1990.