D. Arqù-es, Relations fonctionnelles et denombrement des hypercartes planaires pointees, Combinatoiré enumérative, pp.5-26, 1985.
DOI : 10.1016/0095-8956(75)90042-8

F. Bergeron, G. Labelle, and P. Leroux, Combinatorial species and tree-like structures, volume 67 of Encyclopedia of mathematics and its applications, 1998.

M. Bóna, M. Bousquet, G. Labelle, and P. Leroux, Enumeration of m-Ary Cacti, Advances in Applied Mathematics, vol.24, issue.1, pp.22-56, 2000.
DOI : 10.1006/aama.1999.0665

M. Bousquet, Théorie des espèces et applications au dénombrement de cartes et de cactus planaires, 1998.

M. Bousquet, Quelques résultats sur les cactus planaires, Ann. Sci. Math. Québec, vol.24, issue.2, pp.107-128, 2000.

M. Bousquet, C. Chauve, G. Labelle, and P. Leroux, A bijective proof for the arborescent form of the multivariable Lagrange inversion formula, Trends in mathematics, pp.89-100, 2000.
DOI : 10.1007/978-3-0348-8405-1_8

M. Bousquet, C. Chauve, and G. Schaeffer, Enumération et génération aléatoire de cactus m-aires, Colloque LaCIM of Publications du LaCIM, pp.81-91, 2000.

M. Bousquet-mélou and G. Schaeffer, Enumeration of Planar Constellations, Advances in Applied Mathematics, vol.24, issue.4, pp.337-368, 2000.
DOI : 10.1006/aama.1999.0673

D. Bouya and A. Zvonkin, Topological classification of complex polynomials: new experimental results, 1999.

C. Chauve, Another enumeration of constellations, Formal Power Series and Algebraic Combinatorics, FPSAC'01, pp.149-158, 2001.

C. Chauve, Structures arborescentes :probì emes combinatoires et algorithmiques, 2001.

R. Cori and A. Mach, Mach`?. Maps, hypermaps and their automorphisms: a survey. I, II, III. Exposition, Math, vol.10, issue.5, pp.403-427, 1992.

M. Marraki, N. Hanusse, J. Zipperer, and A. Zvonkin, Cacti, braids and complex polynomials, Sém. Lothar. Combin, vol.37, 1996.

I. J. Good, Generalizations to several variables of Lagrange's expansion, with applications to stochastic processes, Proc. Cambridge Philos. Soc, pp.367-380, 1960.
DOI : 10.2307/1969046

I. P. Goulden and D. M. Jackson, Combinatorial enumeration, 1983.

I. P. Goulden and D. M. Jackson, The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group, European Journal of Combinatorics, vol.13, issue.5, pp.357-365, 1992.
DOI : 10.1016/S0195-6698(05)80015-0

I. P. Goulden and D. M. Kulkarni, Multivariable Lagrange Inversion, Gessel-Viennot Cancellation, and the Matrix Tree Theorem, Journal of Combinatorial Theory, Series A, vol.80, issue.2, pp.295-308, 1997.
DOI : 10.1006/jcta.1997.2827

N. Hanusse, Cartes, constellations et groupes : questions algorithmiques, 1997.

V. A. Liskovets and T. R. Walsh, Enumeration of unicursal maps, Formal Power Series and Algebraic Combinatorics, 2002.

D. Poulalhon, Probì emesénumératifsemes´emesénumératifs autour des cartes combinatoires et des factorisations dans le groupe symétrique, 2002.

D. Poulalhon and G. Schaeffer, A note on bipartite eulerian planar maps. Unpublished note, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00101066

G. Schaeffer, Conjugaison d'arbres et cartes combinatoires aléatoires, 1999.

G. Schaeffer, Random sampling of large planar maps and convex polyhedra, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.760-769, 1999.
DOI : 10.1145/301250.301448
URL : https://hal.archives-ouvertes.fr/inria-00098904

T. R. Walsh, Hypermaps versus bipartite maps, Journal of Combinatorial Theory, Series B, vol.18, issue.2, pp.155-163, 1975.
DOI : 10.1016/0095-8956(75)90042-8