[1] M. Aigner and G. M. Ziegler. Proofs from THE BOOK, volume 4.
Springer-Verlag / Berlin / Heidelberg, 2010.
[2] A. Asinowski and T. Mansour. Dyck paths with coloured ascents. Eu-ropean J. Combin., 29(5):1262 – 1279, 2008.
[3] F. Bédard and A. Goupil. The poset of conjugacy classes and de-composition of products in the symmetric group. Canad. Math. Bull., 35(5):152–160, 1992.
[4] M. Bóna, M. Bousquet, G. Labelle, and P. Leroux. Enumeration of m-ary cacti. Adv. Appl. Math., 24(1):22–56, 2000.
[5] C. W. Borchardt. Ueber eine der Interpolation entsprechende Darstel-lung der Eliminations-Resultante. J. reine angew. Math., 57:111–121, 1860.
[6] A. Cayley. A theorem on trees. Quart. J. Math., 23:376–378, 1889.
[7] C. Chauve, S. Dulucq, and O. Guibert. Enumeration of some labelled trees. In Formal Power Series and Algebraic Combinatorics, pages 146–157.
Springer, 2000.
[8] C. Chauve, S. Dulucq, and A. Rochnitzer. Enumerating alternating trees. J. Combin. Theory, Ser. A, 94:142–151, 2001.
[9] W. Y. Chen. A general bijective algorithm for trees. Proc. Nati. Acad. Sci.
USA, 87:9635–9639, 1990.
[10] J. Cigler. Some Remarks on Catalan Families. European J. Combin., 8(3):261 – 267, 1987.
104
105 List of references
[11] L. Comtet. Advanced Combinatorics: The Art of Finite and Infinite Expan-sions. D. Reidel Publishing Company, 1974.
[12] E. Cotterill. Geometry of curves with exceptional secant planes: linear series along the general curve. Math. Z., 267(3-4):549–582, 2011.
[13] J. Dénes. The representation of a permutation as the product of a min-imal number of transpositions and its connection with the theory of graphs. A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei, 4:63 – 70, 1959.
[14] N. Dershowitz and S. Zaks. Enumerations of ordered trees. Discrete Math., 31(1):9–28, 1980.
[15] E. Deutsch and M. Noy. Statistics on non-crossing trees. Discrete Math., 254(1–3):75 – 87, 2002.
[16] R. Diestel. Graph Theory, vol. 173 of Graduate Texts in Mathematics, 3rd ed. Springer-Verlag, Berlin, 2005.
[17] R. R. X. Du and J. Yin. Counting labelled trees with a given indegree sequence. J. Combin. Theory, Ser. A, 117(3):345 – 353, 2010.
[18] S. Dulucq and J. Penaud. Cordes, arbres et permutations. Discrete Math., 117(1-3):89–105, 1993.
[19] P. H. Edelman. Chain enumeration and non-crossing partitions. Dis-crete Math., 31(2):171–180, 1980.
[20] M. Eden and M. P. Schützenberger. Remark on a theorem of Dénes.
A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Kö-zleményei, 7:353–355, 1962.
[21] G. Evans, J. Blackledge, and P. Yardley. Analytic Methods for Partial Dif-ferential Equations. Springer, 2000.
[22] P. Flajolet and M. Noy. Analytic combinatorics of non-crossing config-urations. Discrete Math., 204(1-3):203 – 229, 1999.
[23] G. W. Ford and G. E. Uhlenbeck. Combinatorial Problems in the Theory of Graphs, I. Proc. Nat. Acad. Sciences, 42:122–128, 1956.
[24] I. M. Gelfand, M. I. Graev, and A. Postnikov. Combinatorics of hyperge-ometric functions associated with positive roots. In The Arnold-Gelfand mathematical seminars, pages 205–221. Springer, 1997.
[25] I. P. Goulden and D. M. Jackson. Combinatorial Enumeration. John-Wiley
& Sons, 1983.
[26] I. P. Goulden and D. M. Jackson. The Combinatorial Relationship Be-tween Trees, Cacti and Certain Connection Coefficients for the Sym-metric Group. European J. Combin., 13(5):357 – 365, 1992.
[27] I. P. Goulden and S. Pepper. Labelled trees and factorizations of a cycle into transpositions. Discrete Math., 113:253 – 268, 1993.
[28] R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics.
Addison-Wesley Publishing Company, 1990.
[29] F. Harary and G. E. Uhlenbeck. On the number of Husimi trees. Proc.
Nat. Aca. Sci., 39:315–322, 1953.
[30] K. Husimi. Note on Mayers’ Theory of Cluster Integrals. J. Chem. Phys., 18:682–684, 1950.
[31] M. Janji´c. Enumerative formulae for some functions on finite sets.
Available online at http://www.pmfbl.org/janjic/enumfun.pdf.
[32] A. Joyal. Une théorie combinatoire des séries formelles. Adv. Math., 42:1–82, 1981.
[33] J. S. Kim. Bijections on rooted trees with fixed size of maximal decreas-ing subtrees. Ann. Combin., pages 339–352, 2013.
[34] G. Kreweras. Sur les partitions non croisees d’un cycle. Discrete Math., 1(4):333–350, 1972.
[35] P. Leroux. Enumerative problems inspired by Mayer’s theory of cluster integrals. Electron. J. Combin., 11(1), 2004.
[36] J. L. Martin and V. Reiner. Factorization of some weighted spanning tree enumerators. J. Combin. Theory, Ser. A, 104(2):287–300, 2003.
107 List of references
[37] J. E. Mayer. Equilibrium Statistical Mechanics: The international encyclo-pedia of physical chemistry and chemical physics. Pergamon Press, Oxford, 1968.
[38] A. Meir and J. W. Moon. On the altitude of nodes in random trees.
Canad. J. Math., 30:997 – 1015, 1978.
[39] J. W. Moon. Counting labelled trees. Canadian Mathematical Congress, 1, 1970.
[40] P. Moszkowski. A Solution to a Problem of Dénes: a Bijection Between Trees and Factorizations of Cyclic Permutations. European J. Combin., 10:13 – 16, 1989.
[41] M. Noy. Enumeration of noncrossing trees on a circle. Discrete Math., 180(1-3):301–313, 1998.
[42] S. X. M. Pang and L. Lv. A Refinement of Leaves on Noncrossing Trees.
Graphs Combin., 29(1):131–143, 2013.
[43] A. Panholzer and H. Prodinger. Bijection for ternary trees and non-crossing trees. Discrete Math., 250(1-3):181–195, 2002.
[44] J. Pitman. Coalescent random forests. J. Combin. Theory, Ser. A, 85:165–
193, 1999.
[45] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math., 68:145– 254, 1937.
[46] G. Pólya and R. C. Read. Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer-Verlag, New York, Berlin, 1987.
[47] A. Postnikov. Intransitive trees. J. Combin. Theory, Ser. A, 79:360–366, 1997.
[48] H. Prodinger. A correspondence between ordered trees and noncross-ing partitions. Discrete Math., 46(2):205–206, 1983.
[49] H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Archiv der Math. u. Physik, 3(47):142–144, 1918.
[50] J. H. Przytycki and A. S. Sikora. Polygon Dissections and Euler, Fuss, Kirkman, and Cayley Numbers. J. Combin. Theory, Ser. A, 92(1):68 – 76, 2000.
[51] J. B. Remmel and S. G. Williamson. Spanning trees and function classes.
Electron. J. Combin., 9(1):229–233, 2002.
[52] S. Seo and H. Shin. On the enumeration of rooted trees with fixed size of maximal decreasing trees. Discrete Math., 312(2):419–426, 2012.
[53] H. Shin and J. Zeng. A bijective enumeration of labelled trees with given indegree sequence. J. Combin. Theory, Ser. A, 118(1):115–128, 2011.
[54] R. Simion. Noncrossing partitions. Discrete Math., 217(1–3):367– 409, 2000.
[55] N. J. A. Sloane. The On-Line Encyclopedia of Integer Sequences (OEIS).
Available online at http://oeis.org.
[56] C. Springer. Factorizations, trees, and cacti. Proceedings of the Eighth In-ternational Conference on Formal Power Series and Algebraic Combinatorics (FPSAC), University of Minnesota, 23:427–438, 1996.
[57] R. P. Stanley. Exercises on Catalan numbers and related numbers.
Available at http://www-math.mit.edu/∼rstan/ec/.
[58] R. P. Stanley. Enumerative Combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cam-bridge, 1999.
[59] J. J. Sylvester. On the change of systems of independent variables.
Quart. J. Math., 1:126–134, 1857.
[60] E. Teufl and S. Wagner. The Number of Spanning Trees in Self-Similar Graphs. Ann. Combin., 15:355–380, 2011.
[61] E. Tzanaki. Polygon dissections and some generalizations of cluster complexes. J. Combin. Theory, Ser. A, 113(6):1189 – 1198, 2006.
[62] S. Wagner. Labeled trees, functions, and an algebraic identity. Electron.
J. Combin., 18, 2011.
109 List of references
[63] H. S. Wilf. Generatingfunctionology. A. K. Peters, Ltd., Natick, MA, USA, 2006.