L. W. Beineke and J. W. Moon, Several proofs of the number of labeled 2-dimensional trees, Proof Techniques in Graph Theory, pp.11-20, 1969.

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, Quelques résultats sur les cactus planaires, Ann. Sci. Math. Québec, vol.24, pp.107-128, 2000.

M. Bousquet and C. Lamathe, Enumeration of solid 2-trees, Proceedings of the 14th conference on Formal power series and algebraic combinatorics, pp.133-147, 2002.

M. Bousquet and C. Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, Discrete Mathematics, vol.298, issue.1-3, pp.115-141, 2005.
DOI : 10.1016/j.disc.2004.11.015

M. Bousquet, Espèces de structures et applications au dénombrement de cartes et de cactus planaires, 1999.

M. Bousquet-mélou, Percolation Models and Animals, European Journal of Combinatorics, vol.17, issue.4, pp.343-369, 1996.
DOI : 10.1006/eujc.1996.0029

M. Delest and J. Fédou, Exact formulas for fully diagonal compact animals, 1989.

N. Dershowitz and S. Zaks, The Cycle Lemma and Some Applications, European Journal of Combinatorics, vol.11, issue.1, pp.35-40, 1990.
DOI : 10.1016/S0195-6698(13)80053-4

E. Deutsch, Another Path to Generalized Catalan Numbers: 10751, The American Mathematical Monthly, vol.108, issue.9, pp.872-873, 2001.
DOI : 10.2307/2695568

E. Deutsch, S. Fereti´cfereti´c, and M. Noy, Diagonally convex directed polyominoes and even trees: a bijection and related issues, Publications du LaCIM, pp.141-149, 2001.
DOI : 10.1016/S0012-365X(02)00340-0

E. Deutsch, S. Fereti´cfereti´c, and M. Noy, Diagonally convex directed polyominoes and even trees: a bijection and related issues, Discrete Mathematics, vol.256, issue.3, pp.645-654, 2002.
DOI : 10.1016/S0012-365X(02)00340-0

E. Deutsch and M. Noy, Statistics on non-crossing trees, Discrete Mathematics, vol.254, issue.1-3, pp.75-87, 2002.
DOI : 10.1016/S0012-365X(01)00366-1

S. Fereti´cfereti´c and D. Svrtan, Combinatorics of diagonally convex directed polyominoes, Proceedings of the 6th conference on Formal power series and algebraic combinatorics, pp.147-168, 1996.

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

T. Fowler, I. Gessel, G. Labelle, and P. Leroux, The Specification of 2-trees, Advances in Applied Mathematics, vol.28, issue.2, pp.145-168, 2002.
DOI : 10.1006/aama.2001.0771

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

F. Harary and E. Palmer, Graphical Enumeration, 1973.

F. Harary, E. Palmer, and R. Read, On the cell-growth problem for arbitrary polygons, Discrete Mathematics, vol.11, issue.3, pp.371-389, 1975.
DOI : 10.1016/0012-365X(75)90041-2

G. Labelle, C. Lamathe, and P. Leroux, Dénombrement des 2-arbres k-gonaux selon la taille et le périmètre, Ann. Sci. Math. Québec

G. Labelle, C. Lamathe, and P. Leroux, A classification of plane and planar 2-trees, Theoretical Computer Science, vol.307, issue.2, pp.337-363, 2003.
DOI : 10.1016/S0304-3975(03)00224-X

G. Labelle, C. Lamathe, and P. Leroux, Labelled and unlabelled enumeration of k-gonal 2-trees, Journal of Combinatorial Theory, Series A, vol.106, issue.2, pp.193-219, 2004.
DOI : 10.1016/j.jcta.2004.01.009

C. Lamathe, Spécification de classes de structures arborescentes, 2003.

B. Leclerc and V. Makarenkov, On some relations between 2-trees and tree metrics, Proceedings of the conference on Discrete metric spaces, pp.223-249, 1998.
DOI : 10.1016/S0012-365X(98)00073-9

P. Leroux, E. Rassart, and A. Robitaille, Enumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice, Advances in Applied Mathematics, vol.21, issue.3, pp.343-380, 1998.
DOI : 10.1006/aama.1998.0601

A. Del-lungo, M. Mirolli, R. Pinzani, and S. Rinaldi, A bijection for directedconvex polyominoes, Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, volume AA of DMTCS Proceedings, pp.133-144, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01182978

J. Marckert and A. Panholzer, Noncrossing trees are almost conditioned Galton? Watson trees. Random Struct, Algorithms, vol.20, issue.1, pp.115-125, 2002.

M. Noy, Enumeration of noncrossing trees on a circle, Proceedings of the 7th conference on Formal power series and algebraic combinatorics, pp.301-313, 1998.
DOI : 10.1016/S0012-365X(97)00121-0

E. Palmer and R. Read, On the Number of Plane 2-Trees, Journal of the London Mathematical Society, vol.2, issue.4, pp.583-592, 1973.
DOI : 10.1112/jlms/s2-6.4.583

A. Panholzer and H. Prodinger, Bijections for ternary trees and non-crossing trees, Discrete Mathematics, vol.250, issue.1-3, pp.181-195, 2002.
DOI : 10.1016/S0012-365X(01)00282-5

J. Penaud, Animaux dirigés diagonalement convexes et arbres ternaires, 1990.

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences
DOI : 10.1007/978-3-540-73086-6_12

L. Takàcs, Enumeration of rooted trees and forests, Math. Sci, vol.18, pp.1-10, 1993.