1. Cormen, T., Stein, C., Rivest, R., Leiserson, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)
2. Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
3. Marx, D.: Eulerian Disjoint Paths Problem in Grid Graphs is NP-Complete. Discrete Applied Mathematics 143, 336–341 (2004)
4. Robertson, N., Seymour, P.D.: Graph Minors XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory (Series B) 63, 65–110 (1995)
5. Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)