{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:59:21Z","timestamp":1775717961657,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T00:00:00Z","timestamp":1771632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T00:00:00Z","timestamp":1771632000000},"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":["12261089"],"award-info":[{"award-number":["12261089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2022JQ-026"],"award-info":[{"award-number":["2022JQ-026"]}],"id":[{"id":"10.13039\/501100017596","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,4]]},"DOI":"10.1007\/s00373-026-03027-7","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T12:02:14Z","timestamp":1771675334000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning Edge-Colored Graphs with Constrained Color Degrees"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6230-0821","authenticated-orcid":false,"given":"Ma","family":"Huawen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,21]]},"reference":[{"key":"3027_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jctb.1996.0062","volume":"68","author":"N Alon","year":"1997","unstructured":"Alon, N.: Disjoint directed cycles. J. Combin. Theory Ser. B 68, 167\u2013178 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3027_CR2","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/jgt.22124","volume":"86","author":"A Ban","year":"2017","unstructured":"Ban, A.: Decomposing weighted graphs. J. Graph Theory 86, 250\u2013254 (2017)","journal-title":"J. Graph Theory"},{"key":"3027_CR3","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.dam.2006.10.005","volume":"155","author":"C Bazgan","year":"2007","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Efficient algorithms for decomposing graphs under degree constraints. Discrete Appl. Math. 155, 979\u2013988 (2007)","journal-title":"Discrete Appl. Math."},{"key":"3027_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190050102","volume":"5","author":"J-C Bermond","year":"1981","unstructured":"Bermond, J.-C., Thomassen, C.: Cycles in digraphs-a survey. J. Graph Theory 5, 1\u201343 (1981)","journal-title":"J. Graph Theory"},{"key":"3027_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/(SICI)1097-0118(200004)33:4<237::AID-JGT4>3.0.CO;2-A","volume":"33","author":"A Diwan","year":"2000","unstructured":"Diwan, A.: Decomposing graphs with girth at least five under degree constraints. J. Graph Theory 33, 237\u2013239 (2000)","journal-title":"J. Graph Theory"},{"issue":"5","key":"3027_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1017\/S0963548319000014","volume":"28","author":"S Fujita","year":"2019","unstructured":"Fujita, S., Li, R., Wang, G.: Decomposing edge-colored graphs under color degree constraints. Combin. Probab. Comput. 28(5), 755\u2013767 (2019)","journal-title":"Combin. Probab. Comput."},{"key":"3027_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0377-2217(99)00459-2","volume":"125","author":"MU Gerber","year":"2000","unstructured":"Gerber, M.U., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. Eur. J. Oper. Res. 125, 283\u2013291 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"3027_CR8","doi-asserted-by":"publisher","first-page":"3288","DOI":"10.1016\/j.disc.2018.08.015","volume":"341","author":"J Hou","year":"2018","unstructured":"Hou, J., Ma, H., Yu, J., Zhang, X.: On partitions of $$K_{2,3}$$-free graphs under degree constraints. Discrete Math. 341, 3288\u20133295 (2018)","journal-title":"Discrete Math."},{"key":"3027_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<7::AID-JGT2>3.0.CO;2-U","volume":"27","author":"A Kaneko","year":"1998","unstructured":"Kaneko, A.: On decomposition of triangle-free graphs under degree constraints. J. Graph Theory 27, 7\u20139 (1998)","journal-title":"J. Graph Theory"},{"key":"3027_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2017.04.007","volume":"226","author":"M Liu","year":"2017","unstructured":"Liu, M., Xu, B.: On partitions of graphs under degree constraints. Discrete Appl. Math. 226, 87\u201393 (2017)","journal-title":"Discrete Appl. Math."},{"key":"3027_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2021.02.028","volume":"295","author":"M Liu","year":"2021","unstructured":"Liu, M., Xu, B.: On a conjecture of Schweser and Stiebitz. Discrete Appl. Math. 295, 25\u201331 (2021)","journal-title":"Discrete Appl. Math."},{"key":"3027_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2025.12.031","volume":"383","author":"J Lin","year":"2026","unstructured":"Lin, J., Ma, H.: On partitions of edge-colored graphs under color degree constraints. Discrete Appl. Math. 383, 1\u20137 (2026)","journal-title":"Discrete Appl. Math."},{"key":"3027_CR13","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz, L.: On decomposition of graphs. Studia Sci. Math. Hungar. 1, 237\u2013238 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"key":"3027_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/jgt.22364","volume":"90","author":"J Ma","year":"2019","unstructured":"Ma, J., Yang, T.: Decomposing $$C_{4}$$-free graphs under degree constraints. J. Graph Theory 90, 13\u201323 (2019)","journal-title":"J. Graph Theory"},{"key":"3027_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.dam.2018.10.016","volume":"257","author":"T Schweser","year":"2019","unstructured":"Schweser, T., Stiebitz, M.: Partitions of multigraphs under minimum degree constraints. Discrete Appl. Math. 257, 269\u2013275 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3027_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","volume":"23","author":"M Stiebitz","year":"1996","unstructured":"Stiebitz, M.: Decomposing graphs under degree constraints. J. Graph Theory 23(3), 321\u2013324 (1996)","journal-title":"J. Graph Theory"},{"key":"3027_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2019.10.027","volume":"279","author":"J Song","year":"2020","unstructured":"Song, J., Xu, B.: Partitions of graphs and multigraphs under degree constraints. Discrete Appl. Math. 279, 134\u2013145 (2020)","journal-title":"Discrete Appl. Math."},{"key":"3027_CR18","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1007\/s00373-021-02335-4","volume":"37","author":"J Song","year":"2021","unstructured":"Song, J., Xu, B.: Partitions of multigraphs without $$C_4$$. Graphs Comb. 37, 2095\u20132111 (2021)","journal-title":"Graphs Comb."},{"key":"3027_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/jgt.3190070204","volume":"7","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory 7, 165\u2013167 (1983a)","journal-title":"J. Graph Theory"},{"key":"3027_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02579195","volume":"3","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Disjoint Cycles in Digraphs. Combinatorica 3, 393\u2013396 (1983b)","journal-title":"Combinatorica"},{"key":"3027_CR21","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.dam.2020.03.014","volume":"283","author":"C Zu","year":"2020","unstructured":"Zu, C.: A note on partitions of graphs under degree constraints. Discrete Appl. Math. 283, 631\u2013633 (2020)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03027-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:14:52Z","timestamp":1775715292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03027-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,21]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3027"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03027-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,21]]},"assertion":[{"value":"14 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2026","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 author declares no conflicts of interest and no data were used to support this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"26"}}