Multicolored Isomorphic Spanning Trees in Complete Graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
430 | en_US |
dc.citation.spage |
423 | en_US |
dc.citation.volume |
122 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Fu, Hung-Lin | en_US |
dc.contributor.author |
Lo, Yuan-Hsun | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2015-12-02T02:59:20Z | |
dc.date.available |
2015-12-02T02:59:20Z | |
dc.date.issued |
2015-07-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.issn |
0381-7032 | en_US |
dc.identifier.journal |
ARS COMBINATORIA | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/128066 | |
dc.identifier.wosnumber |
WOS:000357759600030 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
edge-coloring | en_US |
dc.subject |
complete graph | en_US |
dc.subject |
multicolored spanning trees | en_US |
dc.title |
Multicolored Isomorphic Spanning Trees in Complete Graphs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文