Enumeration of noncrossing trees on a circle

Discrete Mathematics

Volumn 180, Issue 1-3, 1998, Pages 301-313

  Noy, Marc ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004730218     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00121-0     Document Type: Article

References (14)

1. E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974) 485-515.
2. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
3. C. Domb, A.J. Barrett, Enumeration of Ladder Graphs, Discrete Math. 9 (1974) 341-358.
4. S. Dulucq, J.G. Penaud, Cordes, arbres et permutations, Discrete Math. 117 (1993) 89-105.
5. Ph. Flajolet, personal communication.
6. n, in: Proc. 7th Canadian Conf. on Computational Geometry, 1995, 97-102 (full version to appear in Comput. Geom. Theory Appl.).
7. P. Hilton, J. Pedersen, Catalan numbers, their generalization and their uses, Math. Intelligencer 13 (1991) 64-75.
8. J. Moon, Counting labelled trees, Canadian Math. Cong. 1970.
9. J. Moon, L. Moser, Triangular dissections of n-gons, Canad. Math. Bull. 6 (1963) 175-178.
10. M. Noy, Enumeration of non-crossing trees, in: B. Leclerc, J.Y. Thibon, (Eds.), Proc. 7th Formal Power Series and Algebraic Combinatorics, 1995, pp. 465-472.
11. L. Takács, On the number of distinct forests, SIAM J. Discrete Math. 3 (1990) 574-581.
12. G.N. Watson, A proof of Kirkman's hypothesis, Proc. Edinburgh Math. Soc. 13 (1962/63) 131-138.
13. D. Zeilberger, The Method of creative telescoping, J. Symbolic Comput. 11 (1991) 195-204.
14. P. Flajolet, M. Noy, Analytic combinatorics of non-crossing configurations, INRiA Research Report 3196 (1997) (submitted to Discrete Math.).