Bijections between certain families of labelled and unlabelled d-ary trees
Open Access
- 1 January 2009
- journal article
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 3 (1) , 123-136
Abstract
We present enumeration results for d-ary trees whose vertices are coloured by k colours in a specific way. Besides generating functions proofs of these results we also give direct bijections between these coloured trees and uncoloured d-ary trees.Keywords
This publication has 4 references indexed in Scilit:
- Staircase tilings and -Catalan structuresDiscrete Mathematics, 2008
- 2-Binary trees: Bijections and related issuesDiscrete Mathematics, 2008
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balanceThe Annals of Applied Probability, 2006
- On the listing and random generation of hybrid binary treesInternational Journal of Computer Mathematics, 1994