1. A solution of a problem of multicommodity flows in a network;Cherkassky;Ekonomika i Matematicheskie Metody,1977
2. Dominants and submissives of matching polyhedra;Cunningham;Math. Programming,1986
3. The Chinese postman problem;Edmonds;Oper. Res.,1965
4. Maximum matching and polyhedra with (0,1) vertices;Edmonds;J. Res. Nat. Bur. Standards Sect. B,1965
5. Matchings, Euler tours and Chinese postman;Edmonds;Math. Programming,1973