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

  • Manwon Cho
  • Dongsu Kim
  • Seunghyun Seo
  • Heesung Shin
DOI: https://doi.org/10.37236/1851

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.

Published
2004-07-19
How to Cite
Cho, M., Kim, D., Seo, S., & Shin, H. (2004). Colored Prüfer Codes for $k$-Edge Colored Trees. The Electronic Journal of Combinatorics, 11(1), N10. https://doi.org/10.37236/1851
Issue
Volume 11, Issue 1 (2004)
Article Number
N10