Abstract
A direct and elementary method is provided in this paper for counting trees with vertex partition instead of recursion, generating function, functional equation, Lagrange inversion, and matrix methods used before.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Harary F, Tutte W T. The number of plane trees with given partition. Mathematika, 11: 99–101 (1964)
Harary F, Prins G, Tutte W T. The number of plane trees. Akad van W Proc, 67: 319–329 (1964)
Tutte W T. The number of planted plane trees with a given partition. Amer Math Monthly, 71: 272–277 (1964)
Liu Y P. Some functional equations in combinatorics (in Chinese). J Xinyang College (NS). 15: 1–11 (2002)
Liu Y P. Some enumerating problems of maps with vertex partition (in Chinese). Kexue Tongbao, 31: 1009–1014 (1986)
Wu F E, Liu Y P. Enumerations of one-vertex maps with face partition on the plane. Acta Math Sci Ser B, 20: 229–234 (2000)
Liu Y P. Algebraic Principles of Maps (in Chinese). Beijing: Higher Education, 2007
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Grant No. 10571013)
Rights and permissions
About this article
Cite this article
Liu, Y. A new method for counting trees with vertex partition. Sci. China Ser. A-Math. 51, 2000–2004 (2008). https://doi.org/10.1007/s11425-007-0195-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-007-0195-0