1. Reductions to 1-matching polyhedra;Araoz;Networks,1983
2. F. Barahona, “Planar multicommodity flows, max cut, and the Chinese postman problem”, Report 87454-OR, Universität Bonn.
3. A primal algorithm for optimum matching;Cunningham;Math. Programming Stud.,1978
4. Maximum matching and a polyhedron with 0–1 vertices;Edmonds;J. Research Nat. Bur. Stand.,1965
5. Matching: A well-solved class of integer linear programs;Edmonds,1970