Multicolored isomorphic spanning trees in complete graphs
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...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Discrete Mathematics & Theoretical Computer Science
2002-12-01
|
| श्रृंखला: | Discrete Mathematics & Theoretical Computer Science |
| ऑनलाइन पहुंच: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/165 |