On recursively defined combinatorial classes and labelled trees
arXiv:2004.04203
Abstract
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
14 pages, 6 figures, accepted for presentation at the International Conference on Computers Communications and Control (ICCCC), May 2020