On recursively defined combinatorial classes and labelled trees

Authors Ali Chouria, Vlad-Florin Drăgoi, Jean-Gabriel Luque

Publication date 8 April 2020

Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Abstract: We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

This page was built for publication: On recursively defined combinatorial classes and labelled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6338372)