1. , and , Network flows. Optimization ( et al., Eds.). Handbooks in Operations Research and Management Science, Vol. 1. North Holland, New York (1989) 529–572.
2. The perfectly matchable subgraph polytope of a bipartite graph
3. and , The perfectly matchable subgraph polytope of an arbitrary graph. Research Report 87470-OR. Institute for Operations Research, Bonn University (1987).
4. and , Lifting and complementing yields all the facets of positive zero-one programming polytopes. Mathematical Programming ( et al., Eds.). Elsevier, North-Holland, Amsterdam (1984) 13–24.
5. , and , Two terminal Steiner tree polyhedra. Research Report CORR 87-33. Department of Combinatorics and Optimization, University of Waterloo (1987).