{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:44:33Z","timestamp":1649177073604},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9048-6","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T20:55:48Z","timestamp":1175288148000},"page":"365-382","source":"Crossref","is-referenced-by-count":2,"title":["Maximum cyclic 4-cycle packings of the complete multipartite graph"],"prefix":"10.1007","volume":"14","author":[{"given":"Shung-Liang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9048_CR1","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 (2001) Cycle decompositions of K n and K n \u2013 I. J Comb Theory Ser B 81:77\u201399","journal-title":"J Comb Theory Ser B"},{"key":"9048_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0012-365X(99)90049-3","volume":"197\/198","author":"EJ Billington","year":"1999","unstructured":"Billington EJ (1999) Decomposing complete tripartite graphs into cycles of length 3 and 4. Discret Math 197\/198:123\u2013135","journal-title":"Discret Math"},{"key":"9048_CR3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/(SICI)1520-6610(1996)4:6<397::AID-JCD2>3.0.CO;2-A","volume":"4","author":"EJ Billington","year":"1996","unstructured":"Billington EJ, Lindner CC (1996) Maximum packing of uniform group divisible triple systems. J Comb Des 4:397\u2013404","journal-title":"J Comb Des"},{"key":"9048_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/1520-6610(2001)9:2<107::AID-JCD1002>3.0.CO;2-M","volume":"9","author":"EJ Billington","year":"2001","unstructured":"Billington EJ, Fu H-L, Rodger CA (2001) Packing complete multipartite graphs with 4-cycles. J Comb Des 9:107\u2013127","journal-title":"J Comb Des"},{"key":"9048_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00373-004-0601-0","volume":"21","author":"EJ Billington","year":"2005","unstructured":"Billington EJ, Fu H-L, Rodger CA (2005) Packing \u03bb-fold complete multipartite graphs with 4-cycles. Graphs Comb 21:169\u2013185","journal-title":"Graphs Comb"},{"key":"9048_CR6","first-page":"1","volume":"10","author":"D Bryant","year":"2003","unstructured":"Bryant D, Gavlas H, Ling A (2003) Skolem-type difference sets for cycle systems. Electron J Comb 10:1\u201312","journal-title":"Electron J Comb"},{"key":"9048_CR7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/jcd.10061","volume":"11","author":"M Buratti","year":"2003","unstructured":"Buratti M (2003) Rotational k-cycle systems of order v<3h; another proof of the existence of odd cycle systems. J Comb Des 11:433\u2013441","journal-title":"J Comb Des"},{"key":"9048_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s00373-003-0547-7","volume":"20","author":"M Buratti","year":"2004","unstructured":"Buratti M (2004) Existence of 1-rotational k-cycle systems of the complete graph. Graphs Comb 20:41\u201346","journal-title":"Graphs Comb"},{"key":"9048_CR9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0012-365X(02)00463-6","volume":"261","author":"M Buratti","year":"2003","unstructured":"Buratti M, Del Fra A (2003) Existence of cyclic k-cycle systems of the complete graph. Discret Math 261:113\u2013125","journal-title":"Discret Math"},{"key":"9048_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0012-365X(03)00267-X","volume":"279","author":"M Buratti","year":"2004","unstructured":"Buratti M, Del Fra A (2004) Cyclic Hamiltonian cycle systems of the complete graph. Discret Math 279:107\u2013119","journal-title":"Discret Math"},{"key":"9048_CR11","first-page":"193","volume":"18","author":"NJ Cavenagh","year":"1998","unstructured":"Cavenagh NJ (1998) Decompositions of complete tripartite graphs into k-cycles. Australas J Comb 18:193\u2013200","journal-title":"Australas J Comb"},{"key":"9048_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(01)00462-9","volume":"256","author":"NJ Cavenagh","year":"2002","unstructured":"Cavenagh NJ (2002) Further decompositions of complete tripartite graphs into 5-cycles. Discret Math 256:55\u201381","journal-title":"Discret Math"},{"key":"9048_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s003730050003","volume":"16","author":"NJ Cavenagh","year":"2000","unstructured":"Cavenagh NJ, Billington EJ (2000) Decompositions of complete multipartite graphs into cycles of even length. Graphs Comb 16:49\u201365","journal-title":"Graphs Comb"},{"key":"9048_CR14","first-page":"41","volume":"22","author":"NJ Cavenagh","year":"2002","unstructured":"Cavenagh NJ, Billington EJ (2002) On decomposing complete tripartite graphs into 5-cycles. Australas J Comb 22:41\u201362","journal-title":"Australas J Comb"},{"key":"9048_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/1097-0037(200103)37:2<107::AID-NET6>3.0.CO;2-A","volume":"37","author":"CJ Colbourn","year":"2001","unstructured":"Colbourn CJ, Wan P-J (2001) Minimizing drop cost for SONET\/WDM networks with 1\/8 wavelength requirements. Networks 37:107\u2013116","journal-title":"Networks"},{"key":"9048_CR16","first-page":"49","volume":"71","author":"H-L Fu","year":"2004","unstructured":"Fu H-L, Huang W-C (2004) Packing balanced complete multipartite graphs with hexagons. Ars Comb 71:49\u201364","journal-title":"Ars Comb"},{"key":"9048_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.disc.2003.12.009","volume":"282","author":"H-L Fu","year":"2004","unstructured":"Fu H-L, Wu S-L (2004) Cyclically decomposing the complete graph into cycles. Discret Math 282:267\u2013273","journal-title":"Discret Math"},{"key":"9048_CR18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/jgt.3190130405","volume":"13","author":"DG Hoffman","year":"1989","unstructured":"Hoffman DG, Linder CC, Rodger CA (1989) On the construction of odd cycle systems. J Graph Theory 13:417\u2013426","journal-title":"J Graph Theory"},{"key":"9048_CR19","first-page":"229","volume":"15","author":"A Kotzig","year":"1965","unstructured":"Kotzig A (1965) Decompositions of a complete graph into 4k-gons. Mat Fyz Casopis Sloven Akad Vied 15:229\u2013233 (in Russian)","journal-title":"Mat Fyz Casopis Sloven Akad Vied"},{"key":"9048_CR20","first-page":"705","volume-title":"Proceedings of the fifth Hungarian coll., Keszthely, 1976","author":"R Laskar","year":"1978","unstructured":"Laskar R (1978) Decomposition of some composite graphs into Hamiltonian cycles. In: Hajnal A, Sos\u00a0VT (eds) Proceedings of the fifth Hungarian coll., Keszthely, 1976. North-Holland, Amsterdam, pp\u00a0705\u2013716"},{"key":"9048_CR21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4613-3554-2_15","volume-title":"Combinatorics advances","author":"ES Mahmoodian","year":"1995","unstructured":"Mahmoodian ES, Mirzakhani M (1995) Decomposition of complete tripartite graph into 5-cycles. In: Combinatorics advances. Kluwer Academic, Netherlands, pp 235\u2013241"},{"key":"9048_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S0895480101387364","volume":"16","author":"Y Mutoh","year":"2003","unstructured":"Mutoh Y, Morihara T, Jimbo M, Fu H-L (2003) The existence of 2\u00d74 grid-block designs and their applications. SIAM J Discret Math 16:173\u2013178","journal-title":"SIAM J Discret Math"},{"key":"9048_CR23","first-page":"251","volume":"6","author":"R Peltesohn","year":"1938","unstructured":"Peltesohn R (1938) Eine L\u00f6sung der beiden Heffterschen Differenzenprobleme. Compos Math 6:251\u2013257","journal-title":"Compos Math"},{"key":"9048_CR24","doi-asserted-by":"crossref","first-page":"779","DOI":"10.2307\/2528428","volume":"23","author":"DH Ree","year":"1967","unstructured":"Ree DH (1967) Some designs of use in serology. Biometrics 23:779\u2013791","journal-title":"Biometrics"},{"key":"9048_CR25","first-page":"349","volume":"16","author":"A Rosa","year":"1966a","unstructured":"Rosa A (1966a) On cyclic decompositions of the complete graph into (4m+2)-gons. Mat Fyz Casopis Sloven Akad Vied 16:349\u2013352","journal-title":"Mat Fyz Casopis Sloven Akad Vied"},{"key":"9048_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CPM.1966.117555","volume":"91","author":"A Rosa","year":"1966b","unstructured":"Rosa A (1966b) On cyclic decompositions of the complete graph into polygons with odd number of edges. \u010casopis P\u0115st Mat 91:53\u201363 (in Slovak)","journal-title":"\u010casopis P\u0115st Mat"},{"key":"9048_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"M \u0160ajna","year":"2002","unstructured":"\u0160ajna M (2002) Cycle decompositions, III: complete graphs and fixed length cycles. J Comb Des 10:27\u201378","journal-title":"J Comb Des"},{"key":"9048_CR28","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 (1981) Decomposition of K m,n (K m,n * ) into cycles (circuits) of length 2k. J Comb Theory Ser B 30:75\u201381","journal-title":"J Comb Theory Ser B"},{"key":"9048_CR29","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jcd.20002","volume":"12","author":"A Vietri","year":"2004","unstructured":"Vietri A (2004) Cyclic k-cycle system of order 2km+k; a solution of the last open cases. J Comb Des 12:299\u2013310","journal-title":"J Comb Des"},{"key":"9048_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5317-5","volume-title":"Multichannel optical networks: network theory and application","author":"P-J Wan","year":"1999","unstructured":"Wan P-J (1999) Multichannel optical networks: network theory and application, Kluwer Academic, Dordrecht"},{"key":"9048_CR31","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/jcd.20082","volume":"14","author":"S-L Wu","year":"2006","unstructured":"Wu S-L, Fu H-L (2006) Cyclic m-cycle systems with m\u226432 or m=2q with q a prime power. J Comb Des 14:66\u201381","journal-title":"J Comb Des"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9048-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9048-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9048-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:29:42Z","timestamp":1628728182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9048-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9048"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9048-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}