Geodesic
Cyclic decompositions of complete graphs into spanning trees
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 345-353

Voir la notice de l'article provenant de la source Library of Science

We examine decompositions of complete graphs with an even number of vertices, K_2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
Keywords: graph factorization, graph labelling, spanning trees 
@article{DMGT_2004_24_2_a13,
     author = {Froncek, Dalibor},
     title = {Cyclic decompositions of complete graphs into spanning trees},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {345--353},
     publisher = {mathdoc},
     volume = {24},
     number = {2},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a13/}
}
TY  - JOUR
AU  - Froncek, Dalibor
TI  - Cyclic decompositions of complete graphs into spanning trees
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 345
EP  - 353
VL  - 24
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a13/
LA  - en
ID  - DMGT_2004_24_2_a13
ER  - 
%0 Journal Article
%A Froncek, Dalibor
%T Cyclic decompositions of complete graphs into spanning trees
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 345-353
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a13/
%G en
%F DMGT_2004_24_2_a13
Froncek, Dalibor. Cyclic decompositions of complete graphs into spanning trees. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 345-353. http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a13/