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.

E. A. Bender and L. B. Richmond, The asymptotic enumeration of rooted convex polyhedra, Journal of Combinatorial Theory, Series B, vol.36, issue.3, pp.276-283, 1994.
DOI : 10.1016/0095-8956(84)90033-9

N. Bernasconi, K. Panagiotou, and A. Steger, On the degree sequences of random and outerplanar and series-parallel graphs (manuscript)

M. Bodirsky, O. Giménez, M. Kang, and M. Noy, Enumeration and limit laws for series???parallel graphs, European Journal of Combinatorics, vol.28, issue.8, pp.2091-2105, 2007.
DOI : 10.1016/j.ejc.2007.04.011

N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer, Planar Graphs, via Well-Orderly Maps and Trees, Graphs and Combinatorics, vol.22, issue.2, pp.185-202, 2006.
DOI : 10.1007/s00373-006-0647-2
URL : https://hal.archives-ouvertes.fr/hal-00307603

W. G. Brown and W. T. Tutte, On the enumeration of rooted non-separable planar maps, Canad, J. Math, vol.16, pp.572-577, 1964.

A. Denise, M. Vasconcellos, and D. J. Welsh, The random planar graph, Congr. Numer, vol.113, pp.61-79, 1996.

M. Drmota, O. Giménez, and M. Noy, The number of vertices of given degree in series-parallel graphs (submitted)

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, to be published in, 2008.

Z. Gao and N. C. Wormald, The Distribution of the Maximum Vertex Degree in Random Planar Maps, Journal of Combinatorial Theory, Series A, vol.89, issue.2, pp.201-230, 2000.
DOI : 10.1006/jcta.1999.3006

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, The number of planar graphs and properties of random planar graphs, DMTCS Proceedings, pp.147-156, 2005.

O. Giménez, M. Noy, and J. Rué, Graph classes with given 3-connected components: asymptotic counting and critical phenomena, Proc. of Eurcocomb, pp.521-529, 2007.
DOI : 10.1016/j.endm.2007.07.080

V. A. Liskovets, A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps, Journal of Combinatorial Theory, Series B, vol.75, issue.1, pp.116-133, 1999.
DOI : 10.1006/jctb.1998.1870

C. Mcdiarmid, Random graphs on surfaces, Journal of Combinatorial Theory, Series B, vol.98, issue.4, pp.778-797, 2008.
DOI : 10.1016/j.jctb.2007.11.006

C. Mcdiarmid and B. Reed, On the maximum degree of a random planar graph (manuscript)

C. Mcdiarmid, A. Steger, and D. J. Welsh, Random planar graphs, Journal of Combinatorial Theory, Series B, vol.93, issue.2, pp.187-205, 2005.
DOI : 10.1016/j.jctb.2004.09.007

R. C. Mullin and P. J. Schellenberg, The enumeration of c-nets via quadrangulations, Journal of Combinatorial Theory, vol.4, issue.3, pp.259-276, 1968.
DOI : 10.1016/S0021-9800(68)80007-9

M. Noy, Random planar graphs and the number of planar graphs in Combinatorics, pp.213-233, 2007.

D. Osthus, H. J. Prömel, and A. Taraz, On random planar graphs, the number of planar graphs and their triangulations, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.119-134, 2003.
DOI : 10.1016/S0095-8956(02)00040-0

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