Constantine, Gregory - Multicolored isomorphic spanning trees in complete graphs

dmtcs:306 - Discrete Mathematics & Theoretical Computer Science, January 1, 2002, Vol. 5
Multicolored isomorphic spanning trees in complete graphs

Authors: Constantine, Gregory

Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors in such a way that the edges can be partitioned into edge disjoint colorful isomorphic spanning trees? A spanning treee is colorful if all n-1 colors occur among its edges. It is proved that this is possible to accomplish whenever n is a power of two, or five times a power of two.


Volume: Vol. 5
Published on: January 1, 2002
Submitted on: March 26, 2015
Keywords: multicolored tree,Orthogonal Latin squares,colorful matching,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Consultation statistics

This page has been seen 88 times.
This article's PDF has been downloaded 85 times.