1. “Polynomial Algorithms for totally dual integral systems and extensions”;Chandrasakaran;Annals of Discrete Mathematics,1981
2. “A minimal totally dual integral defining system for the b-matching polyhedron”;Cook,1981
3. “A primal algorithm for optimum matching”;Cunningham;Mathematical Programming Study,1978
4. “Paths, trees and flowers”;Edmonds;Canadian Journal of Mathematics,1965
5. “Maximum matching and a polyhedron with (0,1) vertices”;Edmonds;Journal of Research of the National Bureau of Standards,1965