{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T11:25:53Z","timestamp":1771673153683,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00373-011-1105-3","type":"journal-article","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T16:10:34Z","timestamp":1320250234000},"page":"301-313","source":"Crossref","is-referenced-by-count":18,"title":["Decomposition of Complete Graphs into Cycles and Stars"],"prefix":"10.1007","volume":"29","author":[{"given":"Tay-Woei","family":"Shyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,1]]},"reference":[{"key":"1105_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s00373-003-0530-3","volume":"19","author":"A.A. Abueida","year":"2003","unstructured":"Abueida A.A., Daven M.: Multidesigns for graph-pairs of order 4 and 5. Graphs Comb. 19, 433\u2013447 (2003)","journal-title":"Graphs Comb."},{"key":"1105_CR2","first-page":"17","volume":"72","author":"A.A. Abueida","year":"2004","unstructured":"Abueida A.A., Daven M.: Multidecompositions of the complete graph. Ars Comb. 72, 17\u201322 (2004)","journal-title":"Ars Comb."},{"key":"1105_CR3","first-page":"125","volume":"32","author":"A.A. Abueida","year":"2005","unstructured":"Abueida A.A., Daven M., Roblee K.J.: Multidesigns of the \u03bb-fold complete graph for graph-pairs of order 4 and 5. Australas. J. Comb. 32, 125\u2013136 (2005)","journal-title":"Australas. J. Comb."},{"key":"1105_CR4","first-page":"32","volume":"49","author":"A.A. Abueida","year":"2007","unstructured":"Abueida A.A., O\u2019Neil T.: Multidecomposition of \u03bbK m into small cycles and claws. Bull. Inst. Comb. Appl. 49, 32\u201340 (2007)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1105_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1520-6610(1998)6:2<91::AID-JCD2>3.0.CO;2-Q","volume":"6","author":"P. Adams","year":"1998","unstructured":"Adams P., Bryant D.E., Khodkar A.: (3,5)-Cycle decomposition. J. Comb. Des. 6, 91\u2013110 (1998)","journal-title":"J. Comb. Des."},{"key":"1105_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(00)00051-0","volume":"223","author":"P. Adams","year":"2000","unstructured":"Adams P., Bryant D.E., Khodkar A.: On Alspach\u2019s conjecture with two even cycle lengths. Discrete Math. 223, 1\u201312 (2000)","journal-title":"Discrete Math."},{"key":"1105_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0012-365X(81)80029-5","volume":"36","author":"B. Alspach","year":"1981","unstructured":"Alspach B.: Research problems, problem 3. Discrete Math. 36, 333 (1981)","journal-title":"Discrete Math."},{"key":"1105_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jgt.3190090114","volume":"9","author":"B. Alspach","year":"1985","unstructured":"Alspach B., H\u00e4ggkvist R.: Some observations on the Oberwolfach problem. J. Graph Theory 9, 177\u2013187 (1985)","journal-title":"J. Graph Theory"},{"key":"1105_CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/jcd.3180020607","volume":"2","author":"B. Alspach","year":"1994","unstructured":"Alspach B., Marshall S.: Even cycle decompositions of complete graphs minus a 1-factor. J. Comb. Des. 2, 441\u2013458 (1994)","journal-title":"J. Comb. Des."},{"key":"1105_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jctb.2000.1996","volume":"81","author":"B. Alspach","year":"2001","unstructured":"Alspach B., Gavlas H.: Cycle decompositions of K n and K n \u2212I. J. Comb. Theory Ser. B 81, 77\u201399 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1105_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan Press, London (1976)"},{"issue":"2","key":"1105_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0378-3758(98)00084-6","volume":"74","author":"D.E. Bryant","year":"1998","unstructured":"Bryant D.E., Khodkar A., Fu H.L.: (m,n)-Cycle systems. J. Stat. Plann. Inference 74(2), 91\u2013110 (1998)","journal-title":"J. Stat. Plann. Inference"},{"key":"1105_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jcd.10063","volume":"12","author":"D.E. Bryant","year":"2004","unstructured":"Bryant D.E., Maenhaut B.: Decompositions of complete graphs into triangles and Hamilton cycles. J. Comb. Des. 12, 221\u2013232 (2004)","journal-title":"J. Comb. Des."},{"key":"1105_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(01)00051-6","volume":"243","author":"Y. Caro","year":"2002","unstructured":"Caro Y., Yuster R.: List decomposition of graphs. Discrete Math. 243, 67\u201377 (2002)","journal-title":"Discrete Math."},{"key":"1105_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(89)90355-5","volume":"77","author":"K. Heinrich","year":"1989","unstructured":"Heinrich K., Horak P., Rosa A.: On Alspach\u2019s conjecture. Discrete Math. 77, 97\u2013121 (1989)","journal-title":"Discrete Math."},{"key":"1105_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<361::AID-JGT5>3.0.CO;2-P","volume":"23","author":"C. Lin","year":"1996","unstructured":"Lin C., Shyu T.W.: A necessary and sufficient condition for the star decomposition of complete graphs. J. Graph Theory 23, 361\u2013364 (1996)","journal-title":"J. Graph Theory"},{"key":"1105_CR17","unstructured":"Rosa, A.: Alspach\u2019s Conjecture is True for n\u00a0\u2264 10. Mathematical Reports, McMaster University"},{"key":"1105_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"M. \u0160ajna","year":"2002","unstructured":"\u0160ajna M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Comb. Des. 10, 27\u201378 (2002)","journal-title":"J. Comb. Des."},{"key":"1105_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(81)90093-9","volume":"30","author":"D. Sotteau","year":"1981","unstructured":"Sotteau D.: Decomposition of $${K_{m,n}(K^*_{m,n})}$$ into cycles (circuits) of length 2k. J. Comb. Theory Ser. B 30, 75\u201381 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1105_CR20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(79)90034-7","volume":"26","author":"M. Tarsi","year":"1979","unstructured":"Tarsi M.: Decomposition of complete multigraph into stars. Discrete Math. 26, 273\u2013278 (1979)","journal-title":"Discrete Math."},{"key":"1105_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.32917\/hmj\/1206136782","volume":"5","author":"S. Yamamoto","year":"1975","unstructured":"Yamamoto S., Ikeda H., Shige-ede S., Ushio K., Hamada N.: On claw decomposition of complete graphs and complete bipartie graphs. Hiroshima Math. J. 5, 33\u201342 (1975)","journal-title":"Hiroshima Math. J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1105-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1105-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1105-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:01:54Z","timestamp":1560902514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1105-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,1]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1105-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,1]]}}}