Colored Prüfer codes for $k$-edge colored trees.

Cho, Manwon, et al. "Colored Prüfer codes for -edge colored trees.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper N10, 7 p., electronic only-Research paper N10, 7 p., electronic only. <http://eudml.org/doc/124417>.

@article{Cho2004,
author = {Cho, Manwon, Kim, Dongsu, Seo, Seunghyun, Shin, Heesung},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {combinatorial bijection; labelled trees},
language = {eng},
number = {1},
pages = {Research paper N10, 7 p., electronic only-Research paper N10, 7 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Colored Prüfer codes for -edge colored trees.},
url = {http://eudml.org/doc/124417},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Cho, Manwon
AU - Kim, Dongsu
AU - Seo, Seunghyun
AU - Shin, Heesung
TI - Colored Prüfer codes for -edge colored trees.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper N10, 7 p., electronic only
EP - Research paper N10, 7 p., electronic only
LA - eng
KW - combinatorial bijection; labelled trees
UR - http://eudml.org/doc/124417
ER -