1. S. Chopra and M.R. Rao, “On the multiway cut polyhedron,”Networks 21 (1991) 51–89.
2. W.H. Cunningham, “The optimal multiterminal cut problem,”DIMACS Series in Discrete Math. 5 (1991) 105–120.
3. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour and M. Yannakakis, “The complexity of multiway cuts,” extended abstract (1983).
4. P.L. Erdős and L.A. Székely, “Evolutionary trees: an integer multicommodity max—flow-min—cut theorem,”Advances in Applied Mathematics 13 (1992) 375–389.
5. P.L. Erdős and L.A. Székely, “Algorithms and min—max theorems for certain multiway cut,” in: E. Balas, G. Cornuéjols and R. Kannan, eds.,Integer Programming and Combinatorial Optimization, Proceedings of the Conference held at Carnegie Mellon University, May 25–27, 1992, by the Mathematical Programming Society (CMU Press, Pittsburgh, 1992) 334–345.