We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of into spanning trees, arising from the trees with α-labelings.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1284,
author = {Michael Kubesa},
title = {Trees with $\alpha$-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees},
journal = {Discussiones Mathematicae Graph Theory},
volume = {25},
year = {2005},
pages = {311-324},
zbl = {1105.05056},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1284}
}
Michael Kubesa. Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees. Discussiones Mathematicae Graph Theory, Tome 25 (2005) pp. 311-324. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1284/
[000] [1] P. Eldergill, Decompositions of the complete graph with an even number of vertices (M.Sc. thesis, McMaster University, Hamilton, 1997).
[001] [2] D. Froncek, Cyclic decompositions of complete graphs into spanning trees, Discuss. Math. Graph Theory 24 (2004) 345-352, doi: 10.7151/dmgt.1235. | Zbl 1060.05080
[002] [3] D. Froncek, Bi-cyclic decompositions of complete graphs into spanning trees, submitted for publication. | Zbl 1118.05079
[003] [4] D. Froncek and M. Kubesa, Factorizations of complete graphs into spanning trees, Congress. Numer. 154 (2002) 125-134. | Zbl 1021.05083
[004] [5] A. Rosa, Cyclic decompositions of complete graphs (Ph.D. thesis, Slovak Academy of Science, Bratislava, 1965).
[005] [6] A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs, Intl. Symp. Rome 1966 (Gordon and Breach, Dunod, Paris, 1967) 349-355.
[006] [7] M. Kubesa, Spanning tree factorizations of complete graphs, J. Combin. Math. and Combin. Computing, accepted for publication. | Zbl 1067.05059