{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T03:22:32Z","timestamp":1781839352578,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T00:00:00Z","timestamp":1426032000000},"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":[[2016,1]]},"DOI":"10.1007\/s00373-015-1563-0","type":"journal-article","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T11:54:16Z","timestamp":1425988456000},"page":"333-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Generalization of the Problem of Mariusz Meszka"],"prefix":"10.1007","volume":"32","author":[{"given":"Anita","family":"Pasotti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco Antonio","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"1563_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/jcd.3180030507","volume":"3","author":"CA Baker","year":"1995","unstructured":"Baker, C.A.: Extended Skolem sequences. J. Combin. Des. 3, 363\u2013379 (1995)","journal-title":"J. Combin. Des."},{"key":"1563_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-011-9491-3","volume":"62","author":"S Bonvicini","year":"2012","unstructured":"Bonvicini, S., Buratti, M., Rinaldi, G., Traetta, T.: Some progress on the existence of 1-rotational Steiner triple systems. Des. Codes Cryptogr. 62, 63\u201378 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"1563_CR3","first-page":"477","volume-title":"Handbook of Combinatorial Designs","author":"D Bryant","year":"2006","unstructured":"Bryant, D., El-Zanati, S.: Graph decompositions. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 477\u2013486. Chapman & Hall\/CRC, Boca Raton (2006)","edition":"2"},{"key":"1563_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/jcd.1008","volume":"9","author":"M Buratti","year":"2001","unstructured":"Buratti, M.: 1-rotational Steiner triple systems over arbitrary groups. J. Combin. Des. 9, 215\u2013226 (2001)","journal-title":"J. Combin. Des."},{"key":"1563_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcd.21311","volume":"21","author":"M Buratti","year":"2013","unstructured":"Buratti, M., Merola, F.: Dihedral Hamiltonian cycle systems of the cocktail party graph. J. Combin. Des. 21, 1\u201323 (2013)","journal-title":"J. Combin. Des."},{"key":"1563_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/jcd.21351","volume":"22","author":"M Buratti","year":"2014","unstructured":"Buratti, M., Merola, F.: Hamiltonian cycle systems which are both cyclic and symmetric. J. Combin. Des. 22, 367\u2013390 (2014)","journal-title":"J. Combin. Des."},{"key":"1563_CR7","doi-asserted-by":"crossref","unstructured":"Capparelli S., Del Fra A.: Hamiltonian paths in the complete graph with edge-lengths 1,2,3. Electron. J. Combin. 17, $$\\sharp $$ \u266f R44 (2010)","DOI":"10.37236\/316"},{"key":"1563_CR8","first-page":"622","volume-title":"Handbook of Combinatorial Designs","author":"JH Dinitz","year":"2006","unstructured":"Dinitz, J.H.: Starters. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 622\u2013628. Chapman & Hall\/CRC, Boca Raton (2006)","edition":"2"},{"key":"1563_CR9","first-page":"42","volume":"57","author":"JH Dinitz","year":"2009","unstructured":"Dinitz, J.H., Janiszewski, S.R.: On Hamiltonian paths with prescribed edge lengths in the complete graph. Bull. Inst. Combin. Appl. 57, 42\u201352 (2009)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1563_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2478\/s12175-008-0110-3","volume":"59","author":"N Francetic","year":"2009","unstructured":"Francetic, N., Mendelsohn, E.: A survey of Skolem-type sequences and Rosa\u2019s use of them. Math. Slovaca 59, 39\u201376 (2009)","journal-title":"Math. Slovaca"},{"key":"1563_CR11","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.: Algebraic graph theory. Graduate Texts in Mathematics, vol 207. Springer, Berlin (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"1563_CR12","doi-asserted-by":"crossref","unstructured":"Horak, P., Rosa, A.: On a problem of Marco Buratti. Electron. J. Combin. 16, $$\\sharp $$ \u266f R20 (2009)","DOI":"10.37236\/109"},{"key":"1563_CR13","doi-asserted-by":"crossref","unstructured":"Pasotti, A., Pellegrini, M.A.: A new result on the problem of Buratti, Horak and Rosa. Discrete Math. 319, 1\u201314 (2014)","DOI":"10.1016\/j.disc.2013.11.017"},{"key":"1563_CR14","doi-asserted-by":"crossref","unstructured":"Pasotti, A., Pellegrini, M.A.: On the Buratti\u2013Horak\u2013Rosa conjecture about Hamiltonian paths in complete graphs. Electron. J. Combin. 21, $$\\sharp $$ \u266f P2.30 (2014)","DOI":"10.37236\/3879"},{"key":"1563_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.disc.2014.08.019","volume":"338","author":"A Rosa","year":"2015","unstructured":"Rosa, A.: On a problem of Mariusz Meszka. Discrete Math. 338, 139\u2013143 (2015)","journal-title":"Discrete Math."},{"key":"1563_CR16","first-page":"612","volume-title":"Handbook of Combinatorial Designs","author":"N Shalaby","year":"2006","unstructured":"Shalaby, N.: Skolem and Langford Sequences. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 612\u2013616. Chapman & Hall\/CRC, Boca Raton (2006)","edition":"2"},{"key":"1563_CR17","volume-title":"Introduction to Graph Theory","author":"D West","year":"1996","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, New Jersey (1996)"},{"key":"1563_CR18","unstructured":"West, D.: http:\/\/www.math.uiuc.edu\/~west\/regs\/buratti.html . Accessed 28 March 2014"},{"key":"1563_CR19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/jcd.20217","volume":"17","author":"S-L Wu","year":"2009","unstructured":"Wu, S.-L., Buratti, M.: A complete solution to the existence problem for $$1$$ 1 -rotational $$k$$ k -cycle systems of $$K_v$$ K v . J. Combin. Des. 17, 283\u2013293 (2009)","journal-title":"J. Combin. Des."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1563-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1563-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1563-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,30]],"date-time":"2020-08-30T17:27:07Z","timestamp":1598808427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1563-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,11]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1563"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1563-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,11]]}}}