Spanning Tree Factorizations of Complete Graphs

We examine decompositions of complete graphs with an even number of vertices into isomorphic spanning trees. We develop a cyclic factorization of \( K_{2n} \) into non-symmetric spanning trees. Our factorization methods are based on flexible \( q \)-labeling and blended labeling, introduced by Froncek. In this paper, we present several infinite classes of non-symmetric trees which have flexible \( q \)-labeling or blended labeling.