Twelve countings with rooted plane trees

European Journal of Combinatorics

Volumn 18, Issue 2, 1997, Pages 195-210

  Klazar, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444447841     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1995.0095     Document Type: Article

References (14)

1. M. D. Atkinson, The complexity of orders, in: Algorithms and Order, I. Rival (ed.), Dordrecht, Kluwer, 1989.
2. E. Bender, Asymptotic methods in enumeration, SIAM Rev., 16 (1974), 485-515; errata, ibid., 18 (1976), 292.
3. E. R. Canfield, Remarks on an asymptotic method in combinatorics, J. Combin. Theory, Ser. A, 37 (1984), 348-352.
4. W. Y. C. Chen, Ph.D. thesis, M.I.T., Cambridge, MA, 1991.
5. L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht, 1974.
6. I. M. Gessel and R. P. Stanley, Algebraic enumeration, in: Handbook of Combinatorics, R. L. Graham, M. Grötschel and L. Lovász (eds), North-Holland, 1995.
7. I. M. Gessel, B. E. Sagan and Y. Yeh, Enumeration of trees by inversions, J. Graph Theory, 19 (1995), 435-459.
8. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, John Wiley, New York, 1983.
9. A. Meir and J. W. Moon, On an asymptotic method in enumeration, J. Combin. Theory, Ser. A, 51 (1989), 77-89.
10. A. M. Odlyzko, Asymptotic enumeration methods, in: Handbook of Combinatorics, R. L. Graham, M. Grötschel and L. Lovász (eds), North-Holland, 1995.
11. N. J. A. Sloane and collaborators, On-line Encyclopedia of Integer Sequences, Email: sequences@ research.att.com, superseeker@research.att.com.
12. R. Stanley, Enumerative Combinatorics, I, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA, 1986.
13. Wen-Chin Chen and Wen-Chun Ni, Heap-ordered trees, 2-partitions and continued fractions, Europ. J. Combin., 15 (1994), 513-517.
14. H. S. Wilf, Generatingfunctionology, Academic Press, New York, 1994.