AbstractMaking a bijection between semilabelled trees and some partitions, we build up a powerful theory for enumeration of trees. Theorems of Cayley, Menon, Clarke, Rényi, Erdélyi—Etherington are among the consequences. The theory of random semilabelled trees turns into the theory of random set partitions
AbstractWe study two enumeration problems for up–down alternating trees, i.e., rooted labelled trees...
AbstractThis paper presents a simple algorithm to generate all ordered trees with exactly n vertices...
We study two enumeration problems for $\textit{up-down alternating trees}$, i.e., rooted labelled tr...
AbstractMaking a bijection between semilabelled trees and some partitions, we build up a powerful th...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
AbstractThe process of rooting a tree (whose vertices may be labeled) on any one vertex may split th...
AbstractThe combinatorial properties of the set of rooted trees can be viewed algrebraically by cons...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
AbstractLexicographic ordering by spectral moments (S-order) among all trees is discussed in this pa...
AbstractWe study two enumeration problems for up–down alternating trees, i.e., rooted labelled trees...
AbstractThis paper presents a simple algorithm to generate all ordered trees with exactly n vertices...
We study two enumeration problems for $\textit{up-down alternating trees}$, i.e., rooted labelled tr...
AbstractMaking a bijection between semilabelled trees and some partitions, we build up a powerful th...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
AbstractThe process of rooting a tree (whose vertices may be labeled) on any one vertex may split th...
AbstractThe combinatorial properties of the set of rooted trees can be viewed algrebraically by cons...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes ...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
AbstractLexicographic ordering by spectral moments (S-order) among all trees is discussed in this pa...
AbstractWe study two enumeration problems for up–down alternating trees, i.e., rooted labelled trees...
AbstractThis paper presents a simple algorithm to generate all ordered trees with exactly n vertices...
We study two enumeration problems for $\textit{up-down alternating trees}$, i.e., rooted labelled tr...
DOI
Add to ORKG