Colored Prüfer Codes for $k$-Edge Colored Trees

Manwon Cho, Dongsu Kim, Seunghyun Seo, Heesung Shin

Abstract


A combinatorial bijection between $k$-edge colored trees and colored Prüfer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number $k(n-2)!{nk-n\choose n-2}$ of $k$-edge colored trees with $n$ vertices.


Full Text: PDF