{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:34Z","timestamp":1765164094568,"version":"3.46.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science London","doi-asserted-by":"publisher","award":["22K19773, 23K03195"],"award-info":[{"award-number":["22K19773, 23K03195"]}],"id":[{"id":"10.13039\/501100000646","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":[[2025,12]]},"DOI":"10.1007\/s00373-025-02996-5","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T14:59:04Z","timestamp":1763564344000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Path-Cycle Systems with Given End-Vertices in Regular Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Yoshimi","family":"Egawa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7545-0327","authenticated-orcid":false,"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"2996_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20316","volume":"59","author":"T Kaiser","year":"2008","unstructured":"Kaiser, T.: Disjoint $$T$$-paths in tough graphs. J. Graph Theory 59, 1\u201310 (2008)","journal-title":"J. Graph Theory"},{"issue":"4","key":"2996_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00373-023-02680-6","volume":"39","author":"M Furuya","year":"2023","unstructured":"Furuya, M., Kano, M.: Factors with red-blue coloring of claw-free graphs and cubic graphs. Graphs Combin. 39(4), 85 (2023)","journal-title":"Graphs Combin."},{"key":"2996_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111901","volume":"343","author":"H Lu","year":"2020","unstructured":"Lu, H., Kano, M.: Characterization of 1-tough graphs using factors. Discrete Math. 343, 111901 (2020)","journal-title":"Discrete Math."},{"key":"2996_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. Ann. J. Math. 4, 314\u2013328 (1952)","journal-title":"Can. Ann. J. Math."},{"key":"2996_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"4","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Can. Ann. J. Math. 4, 347\u2013352 (1954)","journal-title":"Can. Ann. J. Math."},{"key":"2996_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21919-1","volume-title":"Factors and Factorizations of Graphs, LNM","author":"J Akiyama","year":"2011","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations of Graphs, LNM, vol. 2031. Springer, Berlin, Germany (2011)"},{"key":"2996_CR7","unstructured":"Egawa, Y., Kano, M., Ozeki, K.: Spanning path-cycle systems with given end-vertices in regular graphs (full version), arXiv: 2508.11302"},{"issue":"1","key":"2996_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/12299","volume":"31","author":"M Furuya","year":"2024","unstructured":"Furuya, M., Kano, M.: Degree factors with red-blue coloring of regular graphs. Electron. J. Combin. 31(1), 1\u201340 (2024)","journal-title":"Electron. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02996-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:22Z","timestamp":1765164022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02996-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2996"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02996-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"20 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The third author is a Principal Editor of Graphs and Combinatorics.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"130"}}