Generating labeled planar graphs uniformly at random, Thirtieth International Colloquium on Automata, Languages and Programming, pp.1095-1107, 2003. ,
DOI : 10.1007/3-540-45061-0_84
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.2222
Planar Graphs, via Well-Orderly Maps and Trees, 30 th International Workshop, Graph -Theoretic Concepts in Computer Science (WG), pp.270-284, 2004. ,
DOI : 10.1007/978-3-540-30559-0_23
URL : https://hal.archives-ouvertes.fr/hal-00307603
The random planar graph, Congressus Numerantium, vol.113, pp.61-79, 1996. ,
Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004. ,
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267
A calculus for the random generation of labelled combinatorial structures, 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1-35, 1994. ,
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729
Random planar graphs with a fixed number of edges, 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005. ,
Asymptotic enumeration and limit laws of planar graphs, Journal of the American Mathematical Society, vol.22, issue.2, p.501269, 2004. ,
DOI : 10.1090/S0894-0347-08-00624-3
Graphical Enumeration, 1973. ,
DOI : 10.1007/bfb0066432
Combinatorial algorithms, 1979. ,
Towards a theory of non?repeating contact schemes (russian), Trudi Mat. Inst. Akad. Nauk SSSR 51, pp.226-269, 1958. ,
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