{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T22:48:22Z","timestamp":1791672502871,"version":"4.3.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T00:00:00Z","timestamp":1789948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T00:00:00Z","timestamp":1789948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301445"],"award-info":[{"award-number":["12301445"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ23A010013"],"award-info":[{"award-number":["LQ23A010013"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s00373-026-03065-1","type":"journal-article","created":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T19:31:25Z","timestamp":1790019085000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$P_5$$-Decompositions of 10-Regular Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Chen","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengmeng","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,21]]},"reference":[{"key":"3065_CR1","first-page":"261","volume":"19","author":"M Kouider","year":"1999","unstructured":"Kouider, M., Lonc, Z.: Path decompositions and perfect path double covers. Aust. J. Comb. 19, 261\u2013274 (1999)","journal-title":"Aust. J. Comb."},{"key":"3065_CR2","doi-asserted-by":"crossref","unstructured":"Ringel, G.: Problem 25, in Theory of Graphs and Its Applications (1963)","DOI":"10.1177\/000276426300700309"},{"key":"3065_CR3","doi-asserted-by":"crossref","unstructured":"H\u00e4ggkvist, R.: Decompositions of complete bipartite graphs, in Surveys in Combinatorics, 1989: Invited Papers at the Twelfth British Combinatorial Conference, London Mathematical Society Lecture Note Series, 115\u2013147, Cambridge University Press (1989)","DOI":"10.1017\/CBO9781107359949.007"},{"key":"3065_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.7151\/dmgt.1779","volume":"35","author":"SI El-Zanati","year":"2015","unstructured":"El-Zanati, S.I., Ermete, M., Hasty, J., Plantholt, M.J., Tipnis, S.: On decomposing regular graphs into isomorphic double-stars. Discuss Mathematicae Graph Theory 35, 73\u201379 (2015)","journal-title":"Discuss Mathematicae Graph Theory"},{"key":"3065_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.disc.2014.07.019","volume":"336","author":"J Erde","year":"2014","unstructured":"Erde, J.: Decomposing the cube into paths. Discret. Math. 336, 41\u201345 (2014)","journal-title":"Discret. Math."},{"key":"3065_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/jgt.3190140403","volume":"14","author":"JF Fink","year":"1990","unstructured":"Fink, J.F.: On the decomposition of $$n$$-cubes into isomorphic trees. J. Graph Theory 14, 405\u2013411 (1990)","journal-title":"J. Graph Theory"},{"key":"3065_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0012-365X(91)90396-J","volume":"89","author":"MS Jacobson","year":"1991","unstructured":"Jacobson, M.S., Truszczy\u0144ski, M., Tuza, Z.: Decompositions of regular bipartite graphs. Discret. Math. 89, 17\u201327 (1991)","journal-title":"Discret. Math."},{"key":"3065_CR8","first-page":"469","volume":"4","author":"KF Jao","year":"2013","unstructured":"Jao, K.F., Kostochka, A.V., West, D.B.: Decomposition of cartesian products of regular graphs into isomorphic trees. J. Comb. 4, 469\u2013490 (2013)","journal-title":"J. Comb."},{"key":"3065_CR9","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1016\/j.disc.2017.04.024","volume":"340","author":"F Botler","year":"2017","unstructured":"Botler, F., Talon, A.: Decomposing 8-regular graphs into paths of length 4. Discret. Math. 340, 2275\u20132285 (2017)","journal-title":"Discret. Math."},{"key":"3065_CR10","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.7151\/dmgt.2334","volume":"42","author":"M Xie","year":"2022","unstructured":"Xie, M., Zhou, C.: Decomposing 10-regular graphs into paths of length 5. Discuss. Mathematicae Graph Theory 42, 1089\u20131097 (2022)","journal-title":"Discuss. Mathematicae Graph Theory"},{"key":"3065_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00373-022-02546-3","volume":"38","author":"M Xie","year":"2022","unstructured":"Xie, M., Zhou, C.: Decomposing 2k-regular graphs into paths of length k. Graphs and Comb. 38, 139 (2022)","journal-title":"Graphs and Comb."},{"key":"3065_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03065-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03065-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03065-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T21:50:25Z","timestamp":1791669025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03065-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,21]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["3065"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03065-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,21]]},"assertion":[{"value":"24 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"71"}}