1. Berge, C., Théorie des graphes et ses applications, Dunod, Paris, 1958.
2. Edmonds, J., Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449–467.
3. Edmonds, J., Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Standards 69B (1965), 125–130.
4. Edmonds, J., An introduction to matching, preprinted lectures, Univ. of Mich. Summer Engineering Conf. 1967.
5. Johnson, E.L., Programming in networks and graphs, Operation Research Center Report 65-1, Etchavary Hall, Univ. of Calif., Berkeley.