R. K. Chung, Diameters of graphs: Old problems and new results, Congressus Numerantium, vol.60, 1987.

B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars, pp.313-400, 1997.

J. Italo, M. R. Dejter, and . Fellows, Improving the diameter of a planar graph, 1993.

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions, Algorithmica, vol.15, issue.2, pp.790-810, 2010.
DOI : 10.1007/978-1-4612-0515-9

G. Rodney, M. R. Downey, and . Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

Y. Gao, D. R. Hare, and J. Nastos, The parametric complexity of graph diameter augmentation, Discrete Applied Mathematics, vol.161, issue.10-11, pp.10-111626, 2013.
DOI : 10.1016/j.dam.2013.01.016

P. A. Golovach, C. Requilé, and D. M. Thilikos, Variants of plane diameter completion, 1509.
URL : https://hal.archives-ouvertes.fr/lirmm-01225566

P. Qian, H. Gu, and . Tamaki, Optimal branch-decomposition of planar graphs in O(n 3 ) time, ACM Transactions on Algorithms, vol.4, issue.3, 2008.

C. Li, S. T. Mccormick, and D. Simchi-levi, On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems, Operations Research Letters, vol.11, issue.5, pp.303-308, 1992.
DOI : 10.1016/0167-6377(92)90007-P

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982.
DOI : 10.1137/0211025

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 : https://doi.org/10.1006/jctb.1996.0059

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 : https://doi.org/10.1006/jctb.1996.0059

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001
URL : https://doi.org/10.1006/jctb.1996.0059

A. Anneke, H. L. Schoone, J. Bodlaender, and . Van-leeuwen, Diameter increase caused by edge deletion, Journal of Graph Theory, vol.11, issue.3, pp.409-427, 1987.

D. Paul, R. Seymour, and . Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.