- Published 2010 in Eur. J. Comb.
DOI:10.1016/j.ejc.2009.10.007

We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that the enumeration of these trees leads to a generalization of the Catalan numbers. We also provide bijections between this class of trees and (k + 1)-ary trees as well as generalized… CONTINUE READING

### Presentations referencing similar topics