1. E. Balas and W.R. Pulleyblank [ 1983 ], The perfect matchable subgraph poly tope of a bipartite graph, Networks, Vol. 13 (1983) 495–516.
2. E. Balas and W.R. Pulleyblank [ 1987 ], The perfect matchable subgraph polytope of an arbitrary graph, Research Report CORR87-33(l987), Department of Combinatorics and Optimization, University of Waterloo, to appear in Combinatorica.
3. M. O. Ball, W-G. Liu and W.R. Pullyblank [1987], Two terminal Steiner tree polyhedra, Research Report CORR87-33(1987),Department of Combinatorics and Optimization, University of Waterloo. Appeared In Proceedings of CORE 20th Anniversary Conference.
4. A. Schrijver [ 1986 ], Theory of Linear and Integer Programming, John Wiley and Sons Ltd., Chichester, 1986.
5. F. Barahona and A.R Mahjoub [ 1987 ], Compositions of graphs and polyhedra II: stablesets, Research Report CORR 87-47 1987, Department of Combinatorics and Optimization, University of Waterloo.