1 |
Francois Bergeron, Philippe Flajolet, and Bruno Salvy, Varieties of increasing trees, In CAAP '92 (Rennes, 1992), volume 581 of Lecture Notes in Comput. Sci., pages 24-48. Springer, Berlin, 1992.
|
2 |
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Addison-Wesley Publishing Company Advanced Book Program, Reading, MA, 1989.
|
3 |
Seunghyun Seo and Heesung Shin, A generalized enumeration of labeled trees and reverse Prufer algorithm, J. Combin. Theory Ser. A. 114 (7) (2007), 1357-1361.
DOI
ScienceOn
|
4 |
Seunghyun Seo and Heesung Shin, On the enumeration of rooted trees with fixed size of maximal decreasing trees, Discrete Math. 312 (2) (2012), 419-426.
DOI
ScienceOn
|
5 |
Seunghyun Seo and Heesung Shin, A refinement for ordered labeled trees, Korean J. Math. 20 (2) (2012), 255-261.
과학기술학회마을
DOI
ScienceOn
|
6 |
Richard P. Stanley, Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.
|