1. Integer programming: Methods, uses, computation;Balinski;Management Sci.,1965
2. Labelling to obtain a maximum matching;Balinski,1969
3. Maximum matching and a polyhedron with 0, 1-vertices;Edmonds;J. Res. Nat. Bur. Standards Sect. B,1965
4. Paths, trees, and flowers;Edmonds;Canad. J. Math.,1965
5. The Degree Constrained Subgraph Problem, Lecture;Johnson,1967