Bi-cyclic decompositions of complete graphs into spanning trees Original Research Article

We examine decompositions of complete graphs image into image isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended image-labelling. We also show that for every image and every image there is a tree with diameter image that decomposes image into image factors isomorphic to image.