Packing 5-cycles into balanced complete m-partite graphs for odd m
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
329 | en_US |
dc.citation.issue |
2-3 | en_US |
dc.citation.spage |
323 | en_US |
dc.citation.volume |
14 | en_US |
dc.contributor.author |
Huang, Ming-Hway | en_US |
dc.contributor.author |
Fu, Chin-Mei | en_US |
dc.contributor.author |
Fu, Hung-Lin | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:05:31Z | |
dc.date.available |
2014-12-08T15:05:31Z | |
dc.date.issued |
2007-10-01 | en_US |
dc.description.abstract |
Let K-n1,(n2),..., n(m) be a complete m-partite graph with partite sets of sizes n(1),n(2),...,n(m). A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by K-m(n). In this paper, we completely solve the problem of finding a maximum packing of the balanced complete m-partite graph K-m(n), m odd, with edge-disjoint 5-cycles and we explicitly give the minimum leaves. | en_US |
dc.identifier.doi |
10.1007/s10878-007-9049-5 | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10878-007-9049-5 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/4052 | |
dc.identifier.wosnumber |
WOS:000248864800020 | |
dc.language.iso |
en_US | en_US |
dc.subject |
complete m-partite graph | en_US |
dc.subject |
balanced complete m-partite graph | en_US |
dc.subject |
5-cycle | en_US |
dc.subject |
packing | en_US |
dc.subject |
leave | en_US |
dc.subject |
decomposition | en_US |
dc.title |
Packing 5-cycles into balanced complete m-partite graphs for odd m | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000248864800020.pdf (293.5 KB, Adobe PDF)
所屬典藏: 會議論文
引用此條目
Huang, M.-H., Fu, C.-M., & Fu, H.-L. (2007). Packing 5-cycles into balanced complete m-partite graphs for odd m. JOURNAL OF COMBINATORIAL OPTIMIZATION, 14(2-3), 323–329. https://doi.org/10.1007/s10878-007-9049-5
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/4052