Is there any result known about counting the number of (unlabeled) ordered trees which follow a given ordered degree sequence?
Here an ordered tree is understood as a rooted tree in which the order of the subtrees is significant.
Is there any result known about counting the number of (unlabeled) ordered trees which follow a given ordered degree sequence?
Here an ordered tree is understood as a rooted tree in which the order of the subtrees is significant.