Cyclic decompositions of complete graphs into spanning trees
Dalibor Froncek (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We examine decompositions of complete graphs with an even number of vertices, , 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.