{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:23:25Z","timestamp":1778689405283,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00373-025-02918-5","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:57:01Z","timestamp":1744239421000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Odd-Even Factors of Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Mikio","family":"Kano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9407-1069","authenticated-orcid":false,"given":"Hajime","family":"Matsumura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,10]]},"reference":[{"key":"2918_CR1","volume-title":"Factors and Factorizations of Graphs, LNM 2031","author":"J Akiyama","year":"2011","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations of Graphs, LNM 2031. Springer, London (2011)"},{"key":"2918_CR2","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s00373-020-02225-1","volume":"36","author":"C Bujt\u00e1s","year":"2020","unstructured":"Bujt\u00e1s, C., Jendrol, S., Tuza, Z.: On specific factors in graphs. Graphs Combi. 36, 1391\u20131399 (2020)","journal-title":"Graphs Combi."},{"key":"2918_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/jgt.3190090106","volume":"9","author":"E Enomoto","year":"1985","unstructured":"Enomoto, E., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of $$k$$-factors. J. Graph Theory 9, 87\u201395 (1985)","journal-title":"J. Graph Theory"},{"key":"2918_CR4","first-page":"273","volume":"1","author":"M Guan","year":"1960","unstructured":"Guan, M.: Graphic programming using odd or even points. Chin. Math. 1, 273\u2013277 (1960)","journal-title":"Chin. Math."},{"key":"2918_CR5","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"},{"key":"2918_CR6","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":"2918_CR7","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00373-021-02293-x","volume":"37","author":"H Lu","year":"2021","unstructured":"Lu, H., Yang, Z., Zhang, X.: A characterization for graphs having strong parity factors. Graphs Combin. 37, 945\u2013949 (2021)","journal-title":"Graphs Combin."},{"key":"2918_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01889919","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. II. Acta Mat Hungar. 23, 223\u2013246 (1972)","journal-title":"Acta Mat Hungar."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02918-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02918-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-02918-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:15:21Z","timestamp":1748855721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02918-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,10]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2918"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02918-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,10]]},"assertion":[{"value":"27 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"55"}}