AbstractA combinatorial bijection of the terminal vertices (other than roots) of ordered (rooted plane) trees with the internal vertices (including roots) is described (for ordered trees with at least one edge)
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y =...
We consider plane trees whose vertices are given labels from the set {1, 2,..., k} in such a way tha...
AbstractA combinatorial bijection of the terminal vertices (other than roots) of ordered (rooted pla...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enume...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe introduce the notion of doubly rooted plane trees and give a decomposition of these trees...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractThe Catalan numbers[formula]are known to enumerate the legal bracketings of lengthn [1]as we...
Abstract. We introduce the notion of doubly rooted plane trees and give a de-composition of these tr...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
AbstractIn this paper, we describe the uplift principle for ordered trees which lets us solve a vari...
AbstractWe consider plane trees whose vertices are given labels from the set {1,2,…,k} in such a way...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y =...
We consider plane trees whose vertices are given labels from the set {1, 2,..., k} in such a way tha...
AbstractA combinatorial bijection of the terminal vertices (other than roots) of ordered (rooted pla...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enume...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe introduce the notion of doubly rooted plane trees and give a decomposition of these trees...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractThe Catalan numbers[formula]are known to enumerate the legal bracketings of lengthn [1]as we...
Abstract. We introduce the notion of doubly rooted plane trees and give a de-composition of these tr...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
AbstractIn this paper, we describe the uplift principle for ordered trees which lets us solve a vari...
AbstractWe consider plane trees whose vertices are given labels from the set {1,2,…,k} in such a way...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y =...
We consider plane trees whose vertices are given labels from the set {1, 2,..., k} in such a way tha...
DOI
Add to ORKG