{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:19:13Z","timestamp":1649143153114},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"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":[[2008,6]]},"DOI":"10.1007\/s00373-008-0783-y","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T04:40:22Z","timestamp":1213159222000},"page":"129-147","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths"],"prefix":"10.1007","volume":"24","author":[{"given":"Elizabeth J.","family":"Billington","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas J.","family":"Cavenagh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"783_CR1","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":"783_CR2","doi-asserted-by":"crossref","unstructured":"Balister, P.: Packing circuits into K N . Combinatorics, Probability and Computing 10, 463\u2013499 (2001)","DOI":"10.1017\/S0963548301004771"},{"key":"783_CR3","unstructured":"Balister, P.: Packing closed trails into dense graphs. J. Combinatorial Theory, Ser. B 88, 107\u2013118 (2003)"},{"key":"783_CR4","doi-asserted-by":"crossref","unstructured":"Billington, E.J., Cavenagh, N.J.: Decompositions of complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Mathematical Journal 57, 523\u2013551 (2007)","DOI":"10.1007\/s10587-007-0096-y"},{"key":"783_CR5","unstructured":"Cavenagh, N.J., Billington, E.J.: On decomposing complete tripartite graphs into 5-cycles. Australas. J. Combin. 22, 41\u201362 (2000)"},{"key":"783_CR6","unstructured":"Hor\u0148\u00e1k, M., Kockov\u00e1, Z.: On complete tripartite graphs arbitrarily decomposable into closed trails. Tatra Mt. Math. Publ. 36, 71\u2013107 (2007)"},{"key":"783_CR7","doi-asserted-by":"crossref","unstructured":"Hor\u0148\u00e1k, M., Wo\u017aniak, M.: Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Mathematical Journal 53, 127\u2013134 (2003)","DOI":"10.1023\/A:1022931710349"},{"key":"783_CR8","unstructured":"Kockov\u00e1, Z.: Decomposition of even graphs into closed trails, Abstract at Grafy \u201903, Javorn\u00e1, Czech Republic"},{"key":"783_CR9","unstructured":"\u0160ajna, M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10, 27\u201378 (2002)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0783-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0783-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0783-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0783-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["783"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0783-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}