Multicolored Isomorphic Spanning Trees in Complete Graphs

檔案

本條目沒有附加檔案。

日期

2015-07-01

類型

期刊名稱

ARS COMBINATORIA

卷期與頁次

第 122 卷,頁 423–430

ISSN

0381-7032

語言

英文

摘要

In this paper, we first prove that if the edges of K-2m are properly colored by 2m - 1 colors in such a way that any two colors induce a 2-factor of which each component is a 4-cycle, then K2m, can be decomposed into m isomorphic multicolored spanning trees. Consequently, we show that there exist three disjoint isomorphic multicolored spanning trees in any properly (2m-1)-edge-colored K-2m for m >= 14.

所屬典藏

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

引用此條目

Fu, H.-L., & Lo, Y.-H. (2015). Multicolored Isomorphic Spanning Trees in Complete Graphs. ARS COMBINATORIA, 122, 423–430. https://ir.lib.nycu.edu.tw/handle/11536/128066

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/128066