Multicolored parallelisms of isomorphic spanning trees

S. Akbari*, A. Alipour, Hung-Lin Fu, Y. H. Lo

*此作品的通信作者

研究成果: Article同行評審

7 引文 斯高帕斯(Scopus)

摘要

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 ≠ 2) vertices K2m can be properly edge-colored with 2m - 1 colors in such a way that the edges of K2m can De partitioned into m multicolored isomorphic spanning trees.

原文English
頁(從 - 到)564-567
頁數4
期刊SIAM Journal on Discrete Mathematics
20
發行號3
DOIs
出版狀態Published - 1 十二月 2006

指紋

深入研究「Multicolored parallelisms of isomorphic spanning trees」主題。共同形成了獨特的指紋。

引用此