On recursively defined combinatorial classes and labelled trees
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
READ FULL TEXTWe define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
READ FULL TEXT