1. C. Berge,Graphs et hypergraphs (Dunod, Paris, 1970).
2. V. Chvátal, “Edmonds polytopes and weakly Hamiltonian graphs”,Mathematical Programming 5 (1973) 29–40.
3. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale travelling salesman problem”,Operations Research 2 (1954) 393–410.
4. J. Edmonds, “Maximum matching and a polyhedron with 0, 1 vertices”,Journal of Research of the National Buruea of Standards Sect. B 69 (1965) 125–130.
5. J. Edmonds and E.L. Johnson, “Matching: A well-solved class of integer linear programs”, in R.K. Guy, H. Hanani, N. Sauer and J. Schonheim, eds.,Combinatorial structure and their applications (Gordon and Breach, New York, 1970) pp. 89–92.