{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T10:43:56Z","timestamp":1747046636634},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7886,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For integers a and b, 0 \u2a7d a \u2a7d a \u2a7d b, an [a, b]\u2010graph G satisties a \u2a7d deg(x, G) \u2a7d b for every vertex x of G, and an [a, b]\u2010factor is a spanning subgraph F such that a \u2a7d deg(x, F) \u2a7d b for every vertex x of F. An [a, b]\u2010factor is almost\u2010regular if b = a + 1. A graph is [a, b]\u2010factorable if its edges can be decomposed into [a, b]\u2010factors. When both K and t are positive integers and s is a nonnegative integer, we prove that every [(12K + 2)t + 2ks, (12k + 4)t + 2ks]\u2010graph is [2k,2k + 1]\u2010factorable. As its corollary, we prove that every [r.r + 1]\u2010graph with r \u2a7e 12k<jats:sup>2<\/jats:sup> + 2k is [2k + 1]\u2010factorable, which is a partial extension of the two results, one by Thomassen and the other by Era.<\/jats:p>","DOI":"10.1002\/jgt.3190090110","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:47:44Z","timestamp":1180424864000},"page":"123-128","source":"Crossref","is-referenced-by-count":9,"title":["Almost\u2010regular factorization of graphs"],"prefix":"10.1002","volume":"9","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs and Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_3_2","volume-title":"In Graphs and Applications","author":"Era H.","year":"1984"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_5_2","unstructured":"M.Kano [a b]\u2010factorization of a graph unpublished."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80033-3"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392606"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050415"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70514-4"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:44:51Z","timestamp":1697867091000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["10.1002\/jgt.3190090110"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090110","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}