Skip to Main content Skip to Navigation
Journal articles

Multicolored isomorphic spanning trees in complete graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958977
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:55:48 PM
Last modification on : Thursday, August 22, 2019 - 12:10:38 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:07:21 PM

File

dm050108.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958977, version 1

Collections

Citation

Gregory Constantine. Multicolored isomorphic spanning trees in complete graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.121-126. ⟨hal-00958977⟩

Share

Metrics

Record views

135

Files downloads

806