Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

ArticleOriginal scientific text

Title

Authors ¹

Department of Applied Mathematics, Technical University Ostrava, 17 listopadu, Ostrava-Poruba 708 33, Czech Republic

We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of

K_{2 n}

into spanning trees, arising from the trees with α-labelings.

graph decomposition and factorization, graph labeling, α-labeling, flexible q-labeling, α-like labeling

P. Eldergill, Decompositions of the complete graph with an even number of vertices (M.Sc. thesis, McMaster University, Hamilton, 1997).
D. Froncek, Cyclic decompositions of complete graphs into spanning trees, Discuss. Math. Graph Theory 24 (2004) 345-352, doi: 10.7151/dmgt.1235.
D. Froncek, Bi-cyclic decompositions of complete graphs into spanning trees, submitted for publication.
D. Froncek and M. Kubesa, Factorizations of complete graphs into spanning trees, Congress. Numer. 154 (2002) 125-134.
A. Rosa, Cyclic decompositions of complete graphs (Ph.D. thesis, Slovak Academy of Science, Bratislava, 1965).
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.
M. Kubesa, Spanning tree factorizations of complete graphs, J. Combin. Math. and Combin. Computing, accepted for publication.