{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T05:07:59Z","timestamp":1698642479266},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"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":[[2009,5]]},"DOI":"10.1007\/s00373-008-0826-4","type":"journal-article","created":{"date-parts":[[2009,5,22]],"date-time":"2009-05-22T11:48:04Z","timestamp":1242992884000},"page":"1-14","source":"Crossref","is-referenced-by-count":3,"title":["On the Existence of Elementary Abelian Cycle Systems"],"prefix":"10.1007","volume":"25","author":[{"given":"Anna","family":"Benini","sequence":"first","affiliation":[]},{"given":"Anita","family":"Pasotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,23]]},"reference":[{"key":"826_CR1","unstructured":"Adams, P., Billington, E.J.: Completing some spectra for 2-perfect cycle systems. Austral. J. Combin. 7, 175\u2013187 (1993)"},{"key":"826_CR2","unstructured":"Alspach, B., Gavlas, H.: Cycle decompositions of K n and K n \u00a0\u2212\u00a0I. J. Combin. Theory Ser. B 81, 77\u201399 (2001)"},{"key":"826_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, F.E., Ge, G., Zhu, L.: Existence of Steiner seven-cycle systems. Discrete Math. 252, 1\u201316 (2002)","DOI":"10.1016\/S0012-365X(00)00357-5"},{"key":"826_CR4","doi-asserted-by":"crossref","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory. Cambridge University Press, (1999)","DOI":"10.1017\/CBO9781139507660"},{"key":"826_CR5","unstructured":"Bryant, D., El-Zanati, S.: Graph decompositions. In: Handbook of Combinatorial Designs, Second Edition. Colbourn, C.J., Dinitz, J.H., (eds.), Chapman & Hall\/CRC, Boca Raton, FL, pp. 477\u2013486 (2006)"},{"key":"826_CR6","unstructured":"Bryant, D., Rodger, C.A.: Cycle decompositions. In: Handbook of Combinatorial Designs, Second Edition. Colbourn, C.J., Dinitz, J.H., (eds.), Chapman & Hall\/CRC, Boca Raton, FL, pp. 373\u2013382 (2006)"},{"key":"826_CR7","unstructured":"Bonisoli, A., Buratti, M., Mazzuoccolo, G.: Doubly transitive 2-factorizations. J. Combin. Designs 15, 120\u2013132 (2007)"},{"key":"826_CR8","unstructured":"Buratti, M.: Rotational k-cycle systems of order v\u00a0<\u00a03h; another proof of the existence of odd cycle systems. J. Combin. Designs 11, 433\u2013441 (2003)"},{"key":"826_CR9","unstructured":"Buratti, M.: Cycle decompositions with a sharply vertex transitive automorphism group. Le Matematiche (Catania) 59, 91\u2013105 (2004)"},{"key":"826_CR10","doi-asserted-by":"crossref","unstructured":"Buratti, M., Del Fra, A.: Existence of cyclic k-cycle systems of the complete graph. Discrete Math. 261, 113\u2013125 (2003)","DOI":"10.1016\/S0012-365X(02)00463-6"},{"key":"826_CR11","doi-asserted-by":"crossref","unstructured":"Buratti, M., Del Fra, A.: Cyclic hamiltonian cycle systems of the complete graph. Discrete Math. 279, 107\u2013119 (2004)","DOI":"10.1016\/S0012-365X(03)00267-X"},{"key":"826_CR12","doi-asserted-by":"crossref","unstructured":"Buratti, M., Rania, F., Zuanni, F.: Some constructions for cyclic perfect cycle systems. Discrete Math. 299, 33\u201348 (2005)","DOI":"10.1016\/j.disc.2004.07.021"},{"key":"826_CR13","unstructured":"Granville, A., Moisiadis, A., Rees, R.: Nested Steiner n-cycle systems and perpendicular array. J. Combin. Math. Combin. Comput. 3, 163\u2013167 (1988)"},{"key":"826_CR14","unstructured":"Kotzig, A.: Decomposition of a complete graph into 4k-gons. Mat. Fyz. Casopis Sloven. Akad. Vied 15, 229-233 (1965) (in Russian)"},{"key":"826_CR15","doi-asserted-by":"crossref","unstructured":"Lindner, C.C., Rodger, C.A.: 2-perfect m-cycle systems. Discrete Math. 104, 83\u201390 (1992)","DOI":"10.1016\/0012-365X(92)90626-Q"},{"key":"826_CR16","doi-asserted-by":"crossref","unstructured":"Lindner, C.C., Stinson, D.R.: Steiner pentagon systems. Discrete Math. 52, 67\u201374 (1984)","DOI":"10.1016\/0012-365X(84)90104-3"},{"key":"826_CR17","unstructured":"Manduchi, E.: Steiner heptagon systems. Ars Combin. 31, 76\u201385 (1991)"},{"key":"826_CR18","unstructured":"Peltesohn, R.: Eine losung der beiden heffterschen differenzenprobleme. Compos. Math. 6, 251\u2013257 (1938)"},{"key":"826_CR19","unstructured":"Rosa, A.: On cyclic decompositions of the complete graph into (4m\u00a0+\u00a02)-gons. Mat. Fyz. Casopis Sloven. Akad. Vied 16, 349\u2013352 (1966)"},{"key":"826_CR20","unstructured":"Rosa, A.: On cyclic decompositions of the complete graph into polygons with odd number of edges (Slovak). Casopis Pest. Mat. 91, 53\u201363 (1966)"},{"key":"826_CR21","unstructured":"Rosa, A.: On decompositions of a complete graph into 4n-gons. Mat. Casopis Sloven. Akad. Vied 17, 242\u2013246 (1967) (in Russian)"},{"key":"826_CR22","unstructured":"$$\\tilde{S}$$ ajna, M.: Cycle decompositions of K n and K n \u00a0\u2212\u00a0I. Ph.D. Thesis, Simon Fraser University, July (1999)"},{"key":"826_CR23","unstructured":"$$\\tilde{S}$$ ajna, M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10, 27\u201378 (2002)"},{"key":"826_CR24","doi-asserted-by":"crossref","unstructured":"Vietri, A.: Cyclic k-cycle systems of order 2kn\u00a0+\u00a0k; a solution of the last open cases. J. Combin Designs 12, 299\u2013310 (2004)","DOI":"10.1002\/jcd.20002"},{"key":"826_CR25","doi-asserted-by":"crossref","unstructured":"Vietri, A.: Difference families in $$\\mathbb {Z}_{2d+1}\\oplus\\mathbb{Z}_{2d+1}$$ and infinite translation designs in $$\\mathbb {Z}\\oplus\\mathbb {Z}$$ . Graphs and Comb. 23, 111\u2013121 (2007)","DOI":"10.1007\/s00373-006-0685-9"},{"key":"826_CR26","doi-asserted-by":"crossref","unstructured":"Wu, S.L., Fu, H.L.: A note on cyclic m-cycle systems of K r(m). Graphs and Combin. 22, 427\u2013432 (2006)","DOI":"10.1007\/s00373-006-0658-z"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0826-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0826-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0826-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["826"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0826-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}