{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:00Z","timestamp":1740107100692,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00373-021-02299-5","type":"journal-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T15:00:42Z","timestamp":1620054042000},"page":"1191-1203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of Complete Graphs into Arbitrary Trees"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7240-523X","authenticated-orcid":false,"given":"G.","family":"Sethuraman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Murugan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"2299_CR1","first-page":"17","volume":"72","author":"AA Abueida","year":"2004","unstructured":"Abueida, A.A., Daven, M.: Multidecompositions of the complete graph. Ars Combin. 72, 17\u201322 (2004)","journal-title":"Ars Combin."},{"key":"2299_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/jcd.20170","volume":"16","author":"P Adams","year":"2008","unstructured":"Adams, P., Bryant, D., Buchanan, M.: A survey on the existence of $$G$$-designs. J. Combin. Des. 16, 373\u2013410 (2008)","journal-title":"J. Combin. Des."},{"key":"2299_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1006\/jctb.2000.1996","volume":"81","author":"B Alspach","year":"2001","unstructured":"Alspach, B., Gavlas, H.: Cycle decompositions of $$K_n$$ and $$K_n - I$$. J. Combin. Theory B 81, 77\u201399 (2001)","journal-title":"J. Combin. Theory B"},{"key":"2299_CR4","first-page":"209","volume":"24","author":"SI El Zanati","year":"2001","unstructured":"El Zanati, S.I., Vanden Eynden, C., arong Punnim, N.: On the cyclic decomposition of complete graphs into bipartite graphs. Australas. J. Combin. 24, 209\u2013219 (2001)","journal-title":"Australas. J. Combin."},{"key":"2299_CR5","first-page":"1","volume":"6","author":"JA Gallian","year":"2016","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 6, 1\u2013408 (2016)","journal-title":"Electron. J. Combin."},{"key":"2299_CR6","unstructured":"Ringel, G.: Problem 25, in theory of graphs and its applications. In: Proceedings of the Symposium Smolenice, Prague, p. 162 (1963)"},{"key":"2299_CR7","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, (International Symposium, Rome, July 1966), pp. 349\u2013355. Gordon and Breach, New York and Dunod Paris (1967)"},{"key":"2299_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"M Sajna","year":"2002","unstructured":"Sajna, M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Des 10, 27\u201378 (2002)","journal-title":"J. Combin. Des"},{"key":"2299_CR9","first-page":"257","volume":"97","author":"TW Shyu","year":"2010","unstructured":"Shyu, T.W.: Decompositions of complete graphs into paths and cycles. Ars Combin. 97, 257\u2013270 (2010)","journal-title":"Ars Combin."},{"key":"2299_CR10","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1016\/j.disc.2010.04.009","volume":"330","author":"TW Shyu","year":"2010","unstructured":"Shyu, T.W.: Decompositions of complete graphs into paths and stars. Discrete Math. 330, 2164\u20132169 (2010)","journal-title":"Discrete Math."},{"key":"2299_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0097-3165(83)90040-7","volume":"34","author":"M Tarsi","year":"1983","unstructured":"Tarsi, M.: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J. Combin. Theory A 34, 60\u201370 (1983)","journal-title":"J. Combin. Theory A"},{"key":"2299_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.32917\/hmj\/1206136782","volume":"5","author":"S Yamamoto","year":"1975","unstructured":"Yamamoto, S., Ikedo, H., Shige-eda, S., Ushio, K., Hamada, N.: On claw-decompositions of complete graphs and complete bigraphs. Hiroshima Math. J. 5, 33\u201342 (1975)","journal-title":"Hiroshima Math. J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02299-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02299-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02299-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T07:09:34Z","timestamp":1625036974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02299-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,1]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2299"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02299-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,5,1]]},"assertion":[{"value":"5 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}