R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, 1993.

N. Alon, P. D. Seymour, and R. Thomas, Planar Separators, SIAM Journal on Discrete Mathematics, vol.7, issue.2, pp.184-193, 1994.
DOI : 10.1137/S0895480191198768

J. A. Bondy and U. S. Murty, Graph Theory, 2008.
DOI : 10.1007/978-1-84628-970-5

H. L. Bodlaender, A. Grigoriev, and A. M. Koster, Treewidth Lower Bounds with Brambles, Algorithmica, vol.14, issue.2, pp.81-98, 2008.
DOI : 10.1007/s00453-007-9056-z

Q. P. Gu and H. Tamaki, Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1???+????? ) Time, Proceedings of the 20th International Symposium (ISAAC'2009). Lecture Notes in Computer Science 5878, pp.85-96, 2009.
DOI : 10.1007/978-3-642-10631-6_99

Q. P. Gu and H. Tamaki, Improved bounds on the planar branchwidth with respect to the largest grid minor size, Proceedings of the 21st International Symposium (ISAAC'2010). Lecture Notes in Computer Science 6507, pp.984-993, 2010.

Q. P. Gu and H. Tamaki, Optimal Branch-Decomposition of Planar Graphs in O(n 3) Time, ACM Trans. Algorithms, vol.4, pp.1-13, 2008.
DOI : 10.1007/11523468_31

I. V. Hicks, Planar Branch Decompositions I: The Ratcatcher, INFORMS Journal on Computing, vol.17, issue.4, pp.402-412, 2005.
DOI : 10.1287/ijoc.1040.0075

I. V. Hicks, Planar Branch Decompositions II: The Cycle Method, INFORMS Journal on Computing, vol.17, issue.4, pp.413-421, 2005.
DOI : 10.1287/ijoc.1040.0074

J. E. Hopcroft and R. E. Tarjan, Efficient Planarity Testing, Journal of the ACM, vol.21, issue.4, pp.549-568, 1974.
DOI : 10.1145/321850.321852

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.9787

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N

N. Robertson, P. D. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994.
DOI : 10.1006/jctb.1994.1073

P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, vol.32, issue.2, pp.217-241, 1994.
DOI : 10.1007/BF01215352

R. Thomas, Tree-decompositions of graphs, p.32, 2007.