A. Frank, Edge-disjoint paths in planar graphs, Journal of Combinatorial Theory, Series B, vol.39, issue.2, pp.164-178, 1985.
DOI : 10.1016/0095-8956(85)90046-2

A. Frank, Packing paths, circuits and cuts -a survey, Paths, Flows, and VLSI-Layout, pp.47-100, 1990.

M. R. Kramer and J. Van-leeuwen, The Complexity of Wire-Routing and Finding the Minimum Area Layouts for Arbitrary VLSI Circuits, F.P. Preparata : Advances in Computing Research 2 : VLSI Theory, pp.129-146, 1984.

K. Menger, Zur allgemeinen Kurventheorie, Fundamenta Mathematicae, vol.10, pp.96-115, 1927.
DOI : 10.1007/bf02307626

D. Müller, On the complexity of the planar directed edge-disjoint paths problem, Mathematical Programming, vol.59, issue.2-3, pp.275-288, 2006.
DOI : 10.1007/s10107-005-0653-9

H. Okamura and P. D. Seymour, Multicommodity flows in planar graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.1, pp.75-81, 1981.
DOI : 10.1016/S0095-8956(81)80012-3

H. Okamura, Multicommodity flows in graphs, Discrete Applied Mathematics, vol.6, issue.1, pp.55-62, 1983.
DOI : 10.1016/0166-218X(83)90100-2

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006
URL : http://doi.org/10.1006/jctb.1999.1919

A. Schrijver, Combinatorial Optimization : Polyhedra and Efficiency, 2003.

W. Schwärzler, On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary, Combinatorica, vol.61, issue.1, pp.121-126, 2009.
DOI : 10.1007/s00493-009-2407-4