Journal ArticleOPEN ACCESS

Colored Prüfer codes for k-edge colored trees

Electronic Journal of Combinatorics (2004) 11(1 N) 1-7
DOI: 10.37236/1851
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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)!(n-2nk-n) of k-edge colored trees with n vertices.

Cite

CITATION STYLE

APA

Cho, M., & Kim, D. (2004). Colored Prüfer codes for k-edge colored trees. Electronic Journal of Combinatorics, 11(1 N), 1–7. https://doi.org/10.37236/1851

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free