1. Frank, A. [1990]: Packing paths, circuits and cuts – a survey. In: Paths, Flows, and VLSILayout (B. Korte, L. Lovász, H.J. Prömel, A. Schrijver,Hrsg.), Springer, Berlin 1990, S. 47–100
2. Naves, G., und Sebő, A. [2009]: Multiflow feasibility: an annotated tableau. In: Research Trends in Combinatorial Optimization (W.J. Cook, L. Lovász, J. Vygen, Hrsg.), Springer, Berlin 2009, pp. 261–283
3. Ripphausen-Lipa, H., Wagner, D., und Weihe, K. [1995]: Efficient algorithms for disjoint paths in planar graphs. In: Combinatorial Optimization; DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (W.J. Cook, L. Lovász, P. Seymour, Hrsg.), AMS, Providence 1995
4. Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Kapitel 70–76
5. Shmoys, D.B. [1996]: Cut problems and their application to divide-and-conquer. In: Approximation Algorithms for NP-Hard Problems (D.S. Hochbaum, Hrsg.), PWS, Boston, 1996