1. M. Ball, W.G. Liu and W.R. Pulleyblank, (1987), “Two terminal Steiner tree polyhedra,” Report 87466-OR, Institut für Operations Research Universität Bonn (Bonn, 1987).
2. F. Barahona, “The max cut problem on graphs not contractible toK 5,”Operations Research Letters 2 (1983a) 107–111.
3. F. Barahona, “On some weakly bipartite graphs,”Operations Research Letters 2 (1983b) 239–242.
4. F. Barahona, “Reducing matching to polynomial size linear programming,” (1988), to appear in:SIAM Journal on Optimization.
5. DIMACS Series on Discrete Mathematics and Theoretical Computer Science;F. Barahona,1990