{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:45:16Z","timestamp":1649108716800},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010,1]]},"DOI":"10.1007\/s00373-010-0899-8","type":"journal-article","created":{"date-parts":[[2010,2,19]],"date-time":"2010-02-19T03:45:45Z","timestamp":1266551145000},"page":"133-140","source":"Crossref","is-referenced-by-count":2,"title":["Decomposing Complete Equipartite Graphs into Closed Trails of Length k"],"prefix":"10.1007","volume":"26","author":[{"given":"Benjamin R.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,20]]},"reference":[{"key":"899_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S0963548301004771","volume":"10","author":"P. Balister","year":"2001","unstructured":"Balister P.: Packing circuits into K N . Combin. Probab. Comput. 10, 463\u2013499 (2001)","journal-title":"Combin. Probab. Comput."},{"key":"899_CR2","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10587-007-0096-y","volume":"57","author":"E.J. Billington","year":"2007","unstructured":"Billington E.J., Cavenagh N.J.: Decomposing complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Math. J. 57, 523\u2013551 (2007)","journal-title":"Czechoslovak Math. J."},{"key":"899_CR3","doi-asserted-by":"crossref","unstructured":"Billington, E.J., Cavenagh, N.J., Smith, B.R.: Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discrete Math. (to appear)","DOI":"10.1016\/j.disc.2008.09.003"},{"key":"899_CR4","first-page":"227","volume":"27","author":"E.J. Billington","year":"1998","unstructured":"Billington E.J., Lindner C.C.: Maximum packings of bowtie designs. J. Combin. Math. Combin. Comput. 27, 227\u2013249 (1998)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"899_CR5","first-page":"193","volume":"18","author":"N.J. Cavenagh","year":"1998","unstructured":"Cavenagh N.J.: Decompositions of complete tripartite graphs into k-cycles. Australas. J. Combin. 18, 193\u2013200 (1998)","journal-title":"Australas. J. Combin."},{"key":"899_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(75)90040-0","volume":"11","author":"H. Hanani","year":"1975","unstructured":"Hanani H.: Balanced incomplete block designs and related designs. Discrete Math. 11, 255\u2013369 (1975)","journal-title":"Discrete Math."},{"key":"899_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1022931710349","volume":"53","author":"M. Hor\u0148\u00e1k","year":"2003","unstructured":"Hor\u0148\u00e1k M., Wo\u017aniak M.: Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Math. J. 53, 127\u2013134 (2003)","journal-title":"Czechoslovak Math. J."},{"key":"899_CR8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(77)90021-8","volume":"23","author":"F.K. Hwang","year":"1977","unstructured":"Hwang F.K., Lin S.: Neighbour designs. J. Combin. Theory (Ser. A) 23, 302\u2013313 (1977)","journal-title":"J. Combin. Theory (Ser. A)"},{"key":"899_CR9","unstructured":"Laskar, R.: Decomposition of some composite graphs into hamiltonian cycles. In: Proceedings of the 5th Hungarian Coll., Keszthely, 1976, pp. 705\u2013716. North Holland, Amsterdam (1978)"},{"key":"899_CR10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/jcd.20173","volume":"16","author":"B.R. Smith","year":"2008","unstructured":"Smith B.R.: Decomposing complete equipartite graphs into cycles of length 2p. J. Combin. Des. 16, 244\u2013252 (2008)","journal-title":"J. Combin. Des."},{"key":"899_CR11","first-page":"125","volume":"45","author":"B.R. Smith","year":"2009","unstructured":"Smith B.R.: Complete equipartite 3p-cycle systems. Australas. J. Combin. 45, 125\u2013138 (2009)","journal-title":"Australas. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0899-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0899-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0899-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0899-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["899"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0899-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}