1. A. Bachem and M. Grötschel, “New aspects of polyhedral theory“, in: B. Korte, ed.,Modern applied mathematics — Optimization and operations research (North-Holland, Amsterdam, 1982) 51–106.
2. E. Balas and W.R. Pulleyblank, “The perfectly matchable subgraph polytope of a bipartite graph“,Networks 13 (1983) 495–516.
3. C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973).
4. C. Berge and V. Chvátal,Topics on perfect graphs (North-Holland, Amsterdam, 1984).
5. K. Cameron, “Polyhedral and algorithmic ramifications of antichains”, Ph.D. Thesis, University of Waterloo, 1982.