1. I. Anderson, Perfect matchings of a graph,J. Combin. Theory Ser.,B 10 (1971), 183–186.
2. E. Balas andW. R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph,Networks,13 (1983), 495–516.
3. E.Balas and W. R.Pulleyblank,The perfectly matchable subgraph polytope of an arbitrary graph, Research report 87470-OR, Inst. für Operations Research, Universität Bonn, 1987.
4. W. H.Cunningham and J.Green-Krotki,A separation algorithm for the matchable set polytope, Research report, Inst. für Operations Research, Universität Bonn,1988.
5. J. Edmonds, Maximum matching and a polyhedron with (0,1) vertices,J. Res. Nat. Bur. Standards Sect. B,69 B (1965), 125–130.