E. A. Bender, Z. Gao, and N. C. Wormald, The number of 2-connected labelled planar graphs, Elec. J. Combinatorics, vol.9, p.43, 2002.

N. Bonichon, C. Gavoille, and N. Hanusse, Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation, Lecture Notes in Computer Science, pp.81-92, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307598

P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Mathematics, vol.204, issue.1-3, 1999.
DOI : 10.1016/S0012-365X(98)00372-0
URL : https://hal.archives-ouvertes.fr/inria-00073493

P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

P. Flajolet and R. Sedgewick, Analytic Combinatorics (book in preparation), preliminary version available at http://algo.inria.fr

S. Gerke and C. Mcdiarmid, On the Number of Edges in Random Planar Graphs, Combinatorics, Probability and Computing, vol.13, issue.2, pp.165-183, 2004.
DOI : 10.1017/S0963548303005947

O. Giménez and M. Noy, Asymptotic enumeration and limit laws of planar graphs, math

T. R. Walsh, Counting labelled three-connected and homeomorphically irreducible two-connected graphs, Journal of Combinatorial Theory, Series B, vol.32, issue.1, pp.1-11, 1982.
DOI : 10.1016/0095-8956(82)90072-7
URL : http://doi.org/10.1016/0095-8956(82)90072-7