1. Berge, C., Las Vergnas, M.: On the existence of subgraphs with degree constraints. Indag. Math. 81(1), 165–176 (1978)
2. Edmonds, J., Johnson, E.L.: Matching: a well-solved class of integer linear programs. In: Guy, H., Sauer, S. (eds.) Combinatorial Structures and their Applications, pp. 89–92 (1970)
3. Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bureau Stand. B 69(125–130), 55–56 (1965)
4. Fournier, J.C.: Coloration des aretes d’un graphe. Cah. Centre Etudes Rech. Oper. 15, 311–314 (1973)
5. Gerards, A.: Matching. In: Handbooks of Operations Research and Management Science, Chapter 3, vol. 7, pp. 135–223 (1995)