{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:06:18Z","timestamp":1649059578582},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1433-1","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T15:46:17Z","timestamp":1402415177000},"page":"1703-1714","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["4-Cycle Systems of $$K_n - E(F^*)$$ K n - E ( F \u2217 )"],"prefix":"10.1007","volume":"31","author":[{"given":"Nidhi","family":"Sehgal","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"1433_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.: Cycle decomposition of $$K_n$$ K n and $$K_{n-1}$$ K n - 1 . J. Combin. Theory (B) 81, 77\u201399 (2001)","journal-title":"J. Combin. Theory (B)"},{"key":"1433_CR2","first-page":"129","volume":"76","author":"DJ Ashe","year":"2005","unstructured":"Ashe, D.J., Rodger, C.A., Fu, H.L.: All 2-regular leaves of partial 6-cycle systems. Ars Combin. 76, 129\u2013150 (2005)","journal-title":"Ars Combin."},{"issue":"2","key":"1433_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/jcd.20005","volume":"12","author":"D Bryant","year":"2004","unstructured":"Bryant, D.: Hamilton cycle rich two-factorizations of complete graphs. J. Combin. Designs 12(2), 147\u2013155 (2004)","journal-title":"J. Combin. Designs"},{"key":"1433_CR4","unstructured":"Buchanan II, H.: Graph factors and hamiltonian decompositions, Ph.D. Dissertation, West Virginia University (1997)"},{"key":"1433_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01788673","volume":"5","author":"J Burling","year":"1989","unstructured":"Burling, J., Heinrich, K.: Near 2-factorizations of $$2(K_n)$$ 2 ( K n ) : cycles of even length. Graphs Combin. 5, 213\u2013221 (1989)","journal-title":"Graphs Combin."},{"key":"1433_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s003730050003","volume":"16","author":"NJ Cavenagh","year":"2000","unstructured":"Cavenagh, N.J., Billington, E.J.: Decompositions of complete multipartite graphs into cycles of even length. Graphs Combin. 16, 49\u201365 (2000)","journal-title":"Graphs Combin."},{"key":"1433_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01788106","volume":"2","author":"CJ Colbourn","year":"1986","unstructured":"Colbourn, C.J., Rosa, A.: Quadratic leaves of maximal partial triple systems. Graphs Combin. 2, 317\u2013337 (1986)","journal-title":"Graphs Combin."},{"key":"1433_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0097-3165(93)90078-M","volume":"62","author":"M Colby","year":"1993","unstructured":"Colby, M., Rodger, C.A.: Cycle decompositions of the line graph of $$K_n$$ K n . J. Combin. Theory (A) 62, 158\u2013161 (1993)","journal-title":"J. Combin. Theory (A)"},{"key":"1433_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<173::AID-JGT6>3.0.CO;2-O","volume":"21","author":"BA Cox","year":"1996","unstructured":"Cox, B.A., Rodger, C.A.: Cycle systems of the line graph of the complete graph. J. Graph Theory 21, 173\u2013182 (1996)","journal-title":"J. Graph Theory"},{"key":"1433_CR10","doi-asserted-by":"crossref","first-page":"2901","DOI":"10.1016\/j.disc.2007.07.082","volume":"308","author":"CM Fu","year":"2008","unstructured":"Fu, C.M., Fu, H.L., Smith, T., Rodger, C.A.: All graphs with maximum degree 3 whose complements have a 4-cycle decomposition. Discrete Math. 308, 2901\u20132909 (2008)","journal-title":"Discrete Math."},{"key":"1433_CR11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/PL00013411","volume":"17","author":"HL Fu","year":"2001","unstructured":"Fu, H.L., Rodger, C.A.: Four-cycle systems with two-regular leaves. Graphs Combin. 17, 457\u2013461 (2001)","journal-title":"Graphs Combin."},{"key":"1433_CR12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/jgt.3190130405","volume":"13","author":"DG Hoffman","year":"1989","unstructured":"Hoffman, D.G., Lindner, C.C., Rodger, C.A.: On the construction of odd cycle systems. J. Graph Theory 13, 417\u2013426 (1989)","journal-title":"J. Graph Theory"},{"key":"1433_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00373-008-0763-2","volume":"24","author":"L McCauley","year":"2008","unstructured":"McCauley, L., Rodger, C.A.: Hamilton cycle rich 2-factorizations of complete multipartite graphs. Graphs Combin. 24, 47\u201352 (2008)","journal-title":"Graphs Combin."},{"key":"1433_CR14","doi-asserted-by":"crossref","first-page":"779","DOI":"10.2307\/2528428","volume":"23","author":"DH Rees","year":"1967","unstructured":"Rees, D.H.: Some designs of use in serology. Biometrics 23, 779\u2013791 (1967)","journal-title":"Biometrics"},{"key":"1433_CR15","unstructured":"Rodger, C.A., Sehgal, N.: 4-cycle systems of line graphs of complete multipartite graphs. East West J. Math. Special Volume, 129\u2013136 (2008)"},{"key":"1433_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"MG Sajna","year":"2002","unstructured":"Sajna, M.G.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10, 27\u201378 (2002)","journal-title":"J. Combin. Designs"},{"key":"1433_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jcd.20265","volume":"19","author":"BR Smith","year":"2011","unstructured":"Smith, B.R., Cavenagh, N.J.: Decomposing complete equipartite graphs into short even cycles. J. Combin. Des. 19, 131\u2013143 (2011)","journal-title":"J. Combin. Des."},{"key":"1433_CR18","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})$$ K m , n ( K m , n \u2217 ) into cycles (circuits) of length $$2k$$ 2 k . J. Combin. Theory (B) 30, 75\u201381 (1981)","journal-title":"J. Combin. Theory (B)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1433-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1433-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1433-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:37Z","timestamp":1559041177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1433-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1433"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1433-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,10]]}}}