×

zbMATH — the first resource for mathematics

On the valence sequence of an ordered tree. (English) Zbl 0584.05026
A tree is ordered if the children of each internal node are ordered. This note generalizes the work of S. Zaks in Theor. Comput. Sci. 10, 63- 82 (1980; Zbl 0422.05026)] to give an algorithm to generate lexicographically all ordered trees with n vertices. In the process, a necessary and sufficient condition is obtained for a sequence of non- negative integers to represent the degrees of vertices in an ordered tree.
Reviewer: A.Tucker
MSC:
05C05 Trees
05C30 Enumeration in graph theory
PDF BibTeX XML Cite