完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, Shung-Liangen_US
dc.contributor.authorFu, Hung-Linen_US
dc.date.accessioned2014-12-08T15:05:29Z-
dc.date.available2014-12-08T15:05:29Z-
dc.date.issued2007-10-01en_US
dc.identifier.issn1382-6905en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10878-007-9048-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/4019-
dc.description.abstractA graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipartite graph is balanced if each of its partite sets has the same size. In this paper it is proved that the complete multipartite graph G can be decomposed into 4-cycles cyclically if and only if G is balanced and 4-sufficient. Moreover, the problem of finding a maximum cyclic packing of the complete multipartite graph with 4-cycles are also presented.en_US
dc.language.isoen_USen_US
dc.subjectcomplete multipartite graphen_US
dc.subjectcyclicen_US
dc.subjectcycle systemen_US
dc.subjectcycle packingen_US
dc.subject4-cycleen_US
dc.titleMaximum cyclic 4-cycle packings of the complete multipartite graphen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.doi10.1007/s10878-007-9048-6en_US
dc.identifier.journalJOURNAL OF COMBINATORIAL OPTIMIZATIONen_US
dc.citation.volume14en_US
dc.citation.issue2-3en_US
dc.citation.spage365en_US
dc.citation.epage382en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000248864800023-
顯示於類別:會議論文


文件中的檔案:

  1. 000248864800023.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。