{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:36Z","timestamp":1740107136305,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 103-2115-M-032-002"],"award-info":[{"award-number":["MOST 103-2115-M-032-002"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (C)25400200"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (C)25400200"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (B)15H03636"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (B)15H03636"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1664-9","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T11:56:24Z","timestamp":1448970984000},"page":"1397-1413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths"],"prefix":"10.1007","volume":"32","author":[{"given":"Chin-Mei","family":"Fu","sequence":"first","affiliation":[]},{"given":"Kuo-Ching","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Miwako","family":"Mishima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,1]]},"reference":[{"key":"1664_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0012-365X(81)80029-5","volume":"36","author":"B Alspach","year":"1981","unstructured":"Alspach, B.: Research problems. Discrete Math. 36, 333\u2013334 (1981)","journal-title":"Discrete Math."},{"key":"1664_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.disc.2003.11.021","volume":"284","author":"D Archdeacon","year":"2004","unstructured":"Archdeacon, D., Debowsky, M., Dinitz, J., Gavlas, H.: Cycle systems in the complete bipartite graph minus a one-factor. Discrete Math. 284, 37\u201343 (2004)","journal-title":"Discrete Math."},{"key":"1664_CR3","doi-asserted-by":"crossref","unstructured":"Bryant, D.: Cycle decompositions of complete graphs. In: Hilton, A., Talbot. J.: (eds.) Surveys in Combinatorics 2007, London Mathematical Society Lecture Note Series, vol. 346, Proceedings of the 21st British Combinatorial Conference, Cambridge University Press, pp. 67\u201397 (2007)","DOI":"10.1017\/CBO9780511666209.004"},{"key":"1664_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01929478","volume":"11","author":"D Bryant","year":"1995","unstructured":"Bryant, D., Adams, P.: Decomposing the complete graph into cycles of many lengths. Graphs Combin. 11, 97\u2013102 (1995)","journal-title":"Graphs Combin."},{"key":"1664_CR5","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1112\/plms\/pdt051","volume":"108","author":"D Bryant","year":"2014","unstructured":"Bryant, D., Horsley, D., Pettersson, W.: Cycle decompositions V: complete graphs into cycles of arbitrary lengths. Proc. Lond. Math. Soc. 108, 1153\u20131192 (2014)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1664_CR6","first-page":"373","volume-title":"The CRC Handbook of Combinatorial Designs","author":"D Bryant","year":"2007","unstructured":"Bryant, D., Rodger, C.A.: Cycle decompositions. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 373\u2013382. CRC Press, Boca Raton (2007)","edition":"2"},{"issue":"205\u2013218","key":"1664_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10878-007-9060-x","volume":"14","author":"C-C Chou","year":"2007","unstructured":"Chou, C.-C., Fu, C.-M.: Decomposition of $$K_{m, n}$$ into $$4$$-cycles and $$2t$$-cycles. J. Combin. Optim. 14(205\u2013218), 205\u2013218 (2007)","journal-title":"J. Combin. Optim."},{"issue":"198","key":"1664_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0012-365X(98)00234-9","volume":"197","author":"C-C Chou","year":"1999","unstructured":"Chou, C.-C., Fu, C.-M., Huang, W.-C.: Decomposition of $$K_{m, n}$$ into short cycles. Discrete Math. 197(198), 195\u2013203 (1999)","journal-title":"Discrete Math."},{"key":"1664_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00026-012-0147-4","volume":"16","author":"D Horsley","year":"2012","unstructured":"Horsley, D.: Decomposing various graphs into short even-length cycles. Ann. Combin. 16, 571\u2013589 (2012)","journal-title":"Ann. Combin."},{"key":"1664_CR10","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/050626363","volume":"20","author":"J Ma","year":"2006","unstructured":"Ma, J., Pu, L., Shen, H.: Cycle decompositions of $$K_{n, n}-I$$. SIAM J. Discrete Math. 20, 603\u2013609 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1664_CR11","doi-asserted-by":"publisher","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. Combin. Theory B 30, 75\u201381 (1981)","journal-title":"J. Combin. Theory B"},{"key":"1664_CR12","volume-title":"Introduction to Graph Theory","author":"D West","year":"2007","unstructured":"West, D.: Introduction to Graph Theory, 3rd edn. Prentice Hall, Saddle River (2007)","edition":"3"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1664-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1664-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1664-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1664-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:53:58Z","timestamp":1589446438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1664-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1664"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1664-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2015,12,1]]},"assertion":[{"value":"21 December 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}