{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:16:20Z","timestamp":1780373780732,"version":"3.54.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K13449"],"award-info":[{"award-number":["18K13449"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19K03597"],"award-info":[{"award-number":["19K03597"]}],"id":[{"id":"10.13039\/501100001691","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":[[2023,8]]},"DOI":"10.1007\/s00373-023-02680-6","type":"journal-article","created":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T11:01:36Z","timestamp":1689418896000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Factors with Red\u2013Blue Coloring of Claw-Free Graphs and Cubic Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7545-0327","authenticated-orcid":false,"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,15]]},"reference":[{"key":"2680_CR1","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs. In: LNM 2031. Springer, New York (2011)","DOI":"10.1007\/978-3-642-21919-1"},{"key":"2680_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(94)00085-W","volume":"151","author":"Y Egawa","year":"1996","unstructured":"Egawa, Y., Kano, M.: Sufficient conditions for graphs to have $$(g, f)$$-factors. Discrete Math. 151, 87\u201390 (1996)","journal-title":"Discrete Math."},{"key":"2680_CR3","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":"2680_CR4","doi-asserted-by":"publisher","first-page":"111901","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":"2680_CR5","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. Hungary 23, 223\u2013246 (1972)","journal-title":"Acta Mat. Hungary"},{"key":"2680_CR6","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."},{"key":"2680_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"DP Sumner","year":"1974","unstructured":"Sumner, D.P.: Graphs with 1-factors. Proc. Am. Math. 42, 8\u201312 (1974)","journal-title":"Proc. Am. Math."},{"key":"2680_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/jgt.3190050415","volume":"5","author":"C Thomassen","year":"1981","unstructured":"Thomassen, C.: A remark on the factor theorems of Lov\u00e1sz and Tutte. J. Graph Theory 5, 441\u2013442 (1981)","journal-title":"J. Graph Theory"},{"key":"2680_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0167-5060(08)70514-4","volume":"3","author":"WT Tutte","year":"1978","unstructured":"Tutte, W.T.: The subgraph problem. Ann. Discrete Math. 3, 289\u2013295 (1978)","journal-title":"Ann. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02680-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02680-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02680-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T11:32:47Z","timestamp":1691667167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02680-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2680"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02680-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"22 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2023","order":4,"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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"85"}}