1. J. Aráoz, W.H. Cunningham, J. Edmonds and J. Green-Krótki, “Reductions to 1-matching polyhedra,”Networks 13 (1983) 455–473.
2. G. Calvillo, “The concavity and intersection properties for integral polyhedra,” in: M. Deza and I.G. Rosenberg, eds.,Annals of Discrete Mathematics 8 (North-Holland, Amsterdam, 1980) pp. 221–228.
3. J.O. Cerdeira and C.J. Luz, “Covering nodes with a fixed number of trees,” Technical report, Nota no. 3/85, Centro de Estatística e Aplicacöes, Lisboa/I.N.I.C.
4. J. Edmonds, “Matroids and the greedy algorithm,”Mathematical Programming 1 (1971) 127–136.
5. J. Edmonds and E.L. Johnson, “Matching: A well-solved class of integer linear programs,” in: R.K. Guy, ed.,Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89–92.