N. Bernasconi, K. Panagiotou, and A. Steger, On properties of random dissections and triangulations, SODA '08: Proceedings of the 19 th annual ACM-SIAM symposium on Discrete algorithms, pp.132-141, 2008.
DOI : 10.1007/s00493-010-2464-8

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

B. Bollobás, Random Graphs, 2001.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.4-5577, 2004.
DOI : 10.1109/WSC.2011.6147745

URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Erd?-os and A. Rényi, On the evolution of random graphs, Mag. Tud. Akad. Mat. Kut. Int. Közl, vol.5, pp.17-61, 1960.

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. web edition, 811+xii pages (available from the authors web sites) To be published in, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmerman, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7

URL : https://hal.archives-ouvertes.fr/hal-00917729

´. E. Fusy, Quadratic exact-size and linear approximate-size random generation of planar graphs, Proc., AD, pp.125-138, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184034

Z. Gao and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions, Journal of Computational and Applied Mathematics, vol.41, issue.1-2, pp.177-186, 1992.
DOI : 10.1016/0377-0427(92)90247-U

S. Gerke, C. Mcdiarmid, A. Steger, and A. Weissl, Random planar graphs with n nodes and a fixed number of edges, SODA '05: Proceedings of the 16 th annual ACM-SIAM symposium on Discrete algorithms, pp.999-1007, 2005.

O. Giménez and M. Noy, The number of planar graphs and properties of random planar graphs, Proc., AD, pp.147-156, 2005.

K. Panagiotou and A. Steger, Maximal biconnected components in random planar graphs, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009.

K. Panagiotou and A. Weissl, Properties of random graphs via boltzmann samplers, Proc., AH, pp.159-168, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184800