Aldous, D. (1991) Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab.
Baron, G. and Drmota, M. (1993) Distribution properties of induced subgraphs of trees. Ars Combin.
Bergeron, F., Flajolet, P. and Salvy, B. (1992) Varieties of increasing trees. In CAAP'92: Rennes 1992, Vol. 581 of Lecture Notes in Computer Science, Springer, pp. 24–48.
Devroye, L. (1991) Limit laws for local counters in random binary search trees. Random Struct. Alg.
Devroye, L. (2002/2003) Limit laws for sums of functions of subtrees of random binary search trees. SIAM J. Comput.
Dobrow, R. P. and Fill, J. A. (1999) Total path length for random recursive trees. Combin. Probab. Comput.
Drmota, M. (2009) Random Trees, Springer.
Drmota, M. and Gittenberger, B. (1999) The distribution of nodes of given degree in random trees. J. Graph Theory
Drmota, M. and Gittenberger, B. (2010) The shape of unlabeled rooted random trees. Europ. J. Combin.
Feng, Q., Mahmoud, H. M. and Panholzer, A. (2008) Phase changes in subtree varieties in random recursive and binary search trees. SIAM J. Discrete Math.
Fill, J. A. (1996) On the distribution of binary search trees under the random permutation model. Random Struct. Alg.
Fill, J. A., Flajolet, P. and Kapur, N. (2005) Singularity analysis, Hadamard products, and tree recurrences. J. Comput. Appl. Math.
Fill, J. A. and Kapur, N. (2004) Limiting distributions for additive functionals on Catalan trees. Theoret. Comput. Sci.
Flajolet, P., Gourdon, X. and Marténez, C. (1997) Patterns in random binary search trees. Random Struct. Alg.
Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
Fuchs, M. (2012) Limit theorems for subtree size profiles of increasing trees. Combin. Probab. Comput.
Harary, F. and Palmer, E. M. (1973) Graphical Enumeration, Academic Press.
Hwang, H.-K. (1998) On convergence rates in the central limit theorems for combinatorial structures. Europ. J. Combin.
Hwang, H.-K. and Neininger, R. (2002) Phase change of limit laws in the Quicksort recurrence under varying toll functions. SIAM J. Comput.
Jamison, R. E. (1983) On the average number of nodes in a subtree of a tree. J. Combin. Theory Ser. B
Janson, S. (2003) The Wiener index of simply generated random trees. Random Struct. Alg.
Janson, S. (2005) Asymptotic degree distribution in random recursive trees. Random Struct. Alg.
Klazar, M. (1997) Twelve countings with rooted plane trees. Europ. J. Combin.
Klazar, M. (1997) Addendum: ‘Twelve countings with rooted plane trees’. Europ. J. Combin.
Mahmoud, H. M. (1991) Limiting distributions for path lengths in recursive trees. Probab. Engrg Inform. Sci.
Meir, A. and Moon, J. W. (1978) On the altitude of nodes in random trees. Canad. J. Math.
Meir, A. and Moon, J. W. (1983) On subtrees of certain families of rooted trees. Ars Combin.
Meir, A. and Moon, J. W. (1998) On the log-product of the subtree-sizes of random trees. Random Struct. Alg.
Meir, A. and Moon, J. W. (2002) On centroid branches of trees from certain families. Discrete Math.
Moon, J. W. (1985) On the expected distance from the centroid of a tree. Ars Combin.
Moon, J. W. (1997) On the number of induced subgraphs of trees. Discrete Math.
Otter, R. (1948) The number of trees. Ann. of Math.
Robinson, R. W. and Schwenk, A. J. (1975) The distribution of degrees in a large random tree. Discrete Math.
Takács, L. (1991) Conditional limit theorems for branching processes. J. Appl. Math. Stochastic Anal.
Takács, L. (1992) On the total heights of random rooted trees. J. Appl. Probab.
Vince, A. and Wang, H. (2010) The average order of a subtree of a tree. J. Combin. Theory Ser. B
Wagner, S. (2012) Additive tree functionals with small toll functions and subtrees of random trees. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms: AofA'12, DMTCS Proc. AQ, pp. 67–80.