D. Barth, O. Baudon, and J. Puech, Decomposable trees: a polynomial algorithm for tripodes, Discrete Applied Mathematics, vol.119, issue.3, pp.205-216, 2002.
DOI : 10.1016/S0166-218X(00)00322-X
URL : https://hal.archives-ouvertes.fr/hal-00307866

D. Barth and H. Fournier, A degree bound on decomposable trees, Preprint available at www.prism

J. P. Bell, S. N. Burris, and K. A. Yeats, Counting rooted trees: The universal law t(n) c? ?n n ?3

M. Drmota, Asymptotic distributions and a multivariate darboux method in enumeration problems, Journal of Combinatorial Theory, Series A, vol.67, issue.2, pp.169-184, 1994.
DOI : 10.1016/0097-3165(94)90011-6

I. P. Goulden and D. M. Jackson, Combinatorial enumeration, A Wiley-Interscience Publication, 1983.

F. Harary and E. M. Palmer, Graphical enumeration, 1973.

M. Hor?ák and M. Wo´zniakwo´zniak, Arbitrarily vertex decomposable trees are of maximum degree at most six, Opuscula Math, issue.23, pp.49-62, 2003.

A. Meir and J. W. Moon, On the altitude of nodes in random trees, Canad, J. Math, vol.30, issue.5, pp.997-1015, 1978.

J. W. Moon, The number of trees with a 1-factor, Discrete Math, pp.27-37, 1987.

R. Simion, Trees with a 1-factor: degree distribution, Proceedings of the fifteenth Southeastern conference on combinatorics, graph theory and computing (Baton Rouge, pp.147-159, 1984.

B. Zelinka, Partitionability of trees, Czechoslovak Math, J, vol.38, issue.113 4, pp.677-681, 1988.