Discrete Mathematics & Theoretical Computer Science
Volume 5 n° 1 (2002), pp. 121-126
| author: | Gregory Constantine |
|---|---|
| title: | Multicolored isomorphic spanning trees in complete graphs |
| keywords: | Orthogonal Latin squares, colorful matching, multicolored tree |
| 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
tree 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.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
| reference: | Gregory Constantine (2002), Multicolored isomorphic spanning trees in complete graphs, Discrete Mathematics and Theoretical Computer Science 5, pp. 121-126 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm050108.ps.gz (21 K) |
| ps-source: | dm050108.ps (56 K) |
| pdf-source: | dm050108.pdf (49 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Mon May 27 21:37:55 CEST 2002 by ifalk