Multicolored parallelisms of isomorphic spanning trees

檔案

日期

2006

期刊名稱

SIAM JOURNAL ON DISCRETE MATHEMATICS

摘要

A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m (m not equal 2) vertices K-2m can be properly edge-colored with 2m - 1 colors in such a way that the edges of K-2m can be partitioned into m multicolored isomorphic spanning trees.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料