Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. W. Y. C. Chen and L. L. M. Yang: On Postnikov’s hook length formula for binary trees, European J. Combin. 29 (2008), 1563–1565.
2. R. R. X. Du and F. Liu: (k,m)-Catalan numbers and hook length polynomials for plane trees, European J. Combin. 28 (2007), 1312–1321.
3. I. M. Gessel and S. Seo: A refinement of Cayley’s formula for trees, Electron. J. Combin. 11(2) (2004/06), Research Paper 27, 23 pp.
4. G.-N. Han: Discovering hook lenght formulas by an expansion technique, Electron. J. Combin. 15(1) (2008), Research Paper 133, 41 pp.
5. D. E. Knuth: The Art of Computer Programming, vol. 3, Sorting and Searching, 2nd ed., Addison Wesley, Longman, (1998).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献