1. Discussion paper no. 8212;G. Cornuéjols,1982
2. J. Edmonds and E.L. Johnson “Matching: a well-solved class of integer programs”, in R.K. Guy et al., eds.,Combinatorial structures and their applications (Gordon and Breach, New York, 1970) pp. 89–92.
3. M. Grötschel,Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme (Verlag Anton Hain, Meisenheim am Glan, 1977).
4. R. Halin, “Studies on minimallyn-connected graphs”, in D.J.A. Welsh, ed.,Combinatorial mathematics, and its applications (Academic Press, New York 1971) pp. 129–136.
5. L. Lovász and M. Plummer, “On a family of planar bicritical graphs”,Proceedings of the London Mathematical Society 30 (1975) 160–176.