Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference10 articles.
1. Chen W.Y.C.: A general bijective algorithm for trees. Proc. Natl. Acad. Sci. 87, 9635–9639 (1990)
2. Chen W.Y.C., Yang L.L.M.: On the hook length formula for binary trees. European J. Combin. 29, 1563–1565 (2008)
3. Du R.R.X., Liu F.: (k, m)-Catalan numbers and hook length polynomails for plane trees. European J. Combin. 28, 312–1321 (2007)
4. Erdélyi A., Etherington I.M.H.: Some problems of non-associative combinations (2). Edinburgh Math. Notes 32, 7–12 (1940)
5. Gessel, I.M., Seo, S.: A refinement of Cayley’s formula for trees. Electron. J. Combin. 11, #R27 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献