@inproceedings{10.1007/978-3-030-53651-0_2,
    Abstract = {We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.},
    Address = {Cham},
    Author = {Chouria, Ali and Dr{\u{a}}goi, Vlad-Florin and Luque, Jean-Gabriel},
    BookTitle = {Intelligent Methods in Computing, Communications and Control},
    Editor = {Dzitac, Ioan and Dzitac, Simona and Filip, Florin Gheorghe and Kacprzyk, Janusz and Manolescu, Misu-Jan and Oros, Horea},
    File = {On\_recursively\_defined\_combinatorial\_classes\_and\_l - a.pdf},
    ISBN = {978-3-030-53651-0},
    Pages = {21--34},
    Publisher = {Springer International Publishing},
    Title = {On Recursively Defined Combinatorial Classes and Labelled Trees},
    Year = {2021},
    date-added = {2023-03-11 22:56:59 +0100},
    date-modified = {2023-03-11 22:56:59 +0100},
    file-2 = {On Recursively Defined Combinatorial Classes and Labelled Trees - a.pdf},
    doi = {10.1007/978-3-030-53651-0_2}
}

@inproceedings{10.1007/978-3-030-53651-0_2, Abstract = {We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.}, Address = {Cham}, Author = {Chouria, Ali and Dr{\u{a}}goi, Vlad-Florin and Luque, Jean-Gabriel}, BookTitle = {Intelligent Methods in Computing, Communications and Control}, Editor = {Dzitac, Ioan and Dzitac, Simona and Filip, Florin Gheorghe and Kacprzyk, Janusz and Manolescu, Misu-Jan and Oros, Horea}, File = {On_recursively_defined_combinatorial_classes_and_l - a.pdf}, ISBN = {978-3-030-53651-0}, Pages = {21--34}, Publisher = {Springer International Publishing}, Title = {On Recursively Defined Combinatorial Classes and Labelled Trees}, Year = {2021}, date-added = {2023-03-11 22:56:59 +0100}, date-modified = {2023-03-11 22:56:59 +0100}, file-2 = {On Recursively Defined Combinatorial Classes and Labelled Trees - a.pdf}, doi = {10.1007/978-3-030-53651-0_2} }