Multicolored parallelisms of isomorphic spanning trees
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
567 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
564 | en_US |
dc.citation.volume |
20 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Akbari, S. | en_US |
dc.contributor.author |
Alipour, A. | en_US |
dc.contributor.author |
Fu, H. L. | en_US |
dc.contributor.author |
Lo, Y. H. | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:17:51Z | |
dc.date.available |
2014-12-08T15:17:51Z | |
dc.date.issued |
2006 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1137/S0895480104446015 | en_US |
dc.identifier.issn |
0895-4801 | en_US |
dc.identifier.journal |
SIAM JOURNAL ON DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1137/S0895480104446015 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/12935 | |
dc.identifier.wosnumber |
WOS:000242572400002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
complete graph | en_US |
dc.subject |
multicolored tree | en_US |
dc.subject |
parallelism | en_US |
dc.title |
Multicolored parallelisms of isomorphic spanning trees | en_US |
dc.type |
Article | en_US |
檔案
- 000242572400002.pdf (107.8 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Akbari, S., Alipour, A., Fu, H. L., & Lo, Y. H. (2006). Multicolored parallelisms of isomorphic spanning trees. SIAM JOURNAL ON DISCRETE MATHEMATICS, 20(3), 564–567. https://doi.org/10.1137/S0895480104446015
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/12935