Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Ming-Hwayen_US
dc.contributor.authorFu, Hung-Linen_US
dc.date.accessioned2014-12-08T15:24:06Z-
dc.date.available2014-12-08T15:24:06Z-
dc.date.issued2012-06-01en_US
dc.identifier.issn1027-5487en_US
dc.identifier.urihttp://hdl.handle.net/11536/16763-
dc.description.abstract"In 1981, Alspach conjectured that if 3 <= m(i) <= v, v is odd and v(v - 1)/2 = m(1) +m(2)+ ... +m(t) then the complete graph K-v can be decomposed into t cycles of lengths m(1), m(2), ... , m(t) respectively; if v is even, v(v - 2)/2 = m(1) + m(2) ... + m(t), then the complete graph minus a one-factor K-v - F can be decomposed into t cycles of lengths m(1), m(2),..., Tat respectively. In this paper, we extend the study to the decomposition of the complete equipartite graph K-m(n).For m(i) is an element of {4, 5}, we prove that the trivial necessary conditions are also sufficient."en_US
dc.language.isoen_USen_US
dc.title"(4,5)-CYCLE SYSTEMS OF COMPLETE MULTIPARTITE GRAPHS"en_US
dc.typeArticleen_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.citation.volume16en_US
dc.citation.issue3en_US
dc.citation.spageen_US
dc.citation.epage999en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
Appears in Collections:Articles