Geodesic
Colored Prüfer codes for \(k\)-edge colored trees
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1851
Classification : 05C05, 05C30
Mots-clés : combinatorial bijection, labelled trees 
@article{10_37236_1851,
     author = {Manwon Cho and Dongsu Kim and Seunghyun Seo and Heesung Shin},
     title = {Colored {Pr\"ufer} codes for \(k\)-edge colored trees},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1851},
     zbl = {1060.05021},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1851/}
}
TY  - JOUR
AU  - Manwon Cho
AU  - Dongsu Kim
AU  - Seunghyun Seo
AU  - Heesung Shin
TI  - Colored Prüfer codes for \(k\)-edge colored trees
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1851/
DO  - 10.37236/1851
ID  - 10_37236_1851
ER  - 
%0 Journal Article
%A Manwon Cho
%A Dongsu Kim
%A Seunghyun Seo
%A Heesung Shin
%T Colored Prüfer codes for \(k\)-edge colored trees
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1851/
%R 10.37236/1851
%F 10_37236_1851
Manwon Cho; Dongsu Kim; Seunghyun Seo; Heesung Shin. Colored Prüfer codes for \(k\)-edge colored trees. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1851

Cité par Sources :