{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:15:47Z","timestamp":1757618147870,"version":"3.44.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Natural Science Basic Research Program of Shaanxi","award":["2023-JC-YB-001","2023-JC-YB-054"],"award-info":[{"award-number":["2023-JC-YB-001","2023-JC-YB-054"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["ZYTS24076"],"award-info":[{"award-number":["ZYTS24076"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02935-4","type":"journal-article","created":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T14:48:49Z","timestamp":1748702929000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equitable Vertex Arboricity of Graphs with Low Maximum Degree"],"prefix":"10.1007","volume":"41","author":[{"given":"Ping","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weichan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5250-1657","authenticated-orcid":false,"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,31]]},"reference":[{"issue":"2","key":"2935_CR1","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/s10878-016-9997-8","volume":"34","author":"G Chen","year":"2017","unstructured":"Chen, G., Gao, Y., Shan, S., Wang, G., Wu, J.: Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34(2), 426\u2013432 (2017)","journal-title":"J. Comb. Optim."},{"issue":"18","key":"2935_CR2","doi-asserted-by":"publisher","first-page":"6353","DOI":"10.2298\/FIL1818353D","volume":"32","author":"E Drgas-Burchardt","year":"2018","unstructured":"Drgas-Burchardt, E., Dybizba\u0144ski, J., Furma\u0144czyk, H., Sidorowicz, E.: Equitable list vertex colourability and arboricity of grids. Filomat 32(18), 6353\u20136374 (2018)","journal-title":"Filomat"},{"key":"2935_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2020.08.001","volume":"844","author":"E Drgas-Burchardt","year":"2020","unstructured":"Drgas-Burchardt, E., Furma\u0144czyk, H., Sidorowicz, E.: Equitable improper choosability of graphs. Theor. Comput. Sci. 844, 34\u201345 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"2935_CR4","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.ipl.2015.06.016","volume":"115","author":"Z Guo","year":"2015","unstructured":"Guo, Z., Zhao, H., Mao, Y.: The equitable vertex arboricity of complete tripartite graphs. Inf. Process. Lett. 115(12), 977\u2013982 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"2935_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1142\/S1793830915500561","volume":"7","author":"Z Guo","year":"2015","unstructured":"Guo, Z., Zhao, H., Mao, Y.: On the equitable vertex arboricity of complete tripartite graphs. Discrete Math. Algorithms Appl. 7(4), 22 (2015)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"2935_CR6","first-page":"419","volume":"80","author":"H Kaul","year":"2021","unstructured":"Kaul, H., Mudrock, J.A., Pelsmajer, M.J.: On equitable list arboricity of graphs. Aust. J. Comb. 80, 419\u2013441 (2021)","journal-title":"Aust. J. Comb."},{"issue":"6","key":"2935_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disc.2021.112351","volume":"344","author":"R Kim","year":"2021","unstructured":"Kim, R., Oum, S.-I., Zhang, X.: Equitable partition of planar graphs. Discrete Math. 344(6), 6 (2021)","journal-title":"Discrete Math."},{"issue":"1","key":"2935_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10878-019-00461-7","volume":"39","author":"B Li","year":"2020","unstructured":"Li, B., Zhang, X.: Tree-coloring problems of bounded treewidth graphs. J. Comb. Optim. 39(1), 156\u2013169 (2020)","journal-title":"J. Comb. Optim."},{"key":"2935_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2020.11.016","volume":"855","author":"Y Li","year":"2021","unstructured":"Li, Y., Zhang, X.: Equitable list tree-coloring of bounded treewidth graphs. Theor. Comput. Sci. 855, 61\u201367 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2935_CR10","first-page":"403","volume":"99","author":"Y Mao","year":"2016","unstructured":"Mao, Y., Guo, Z., Zhao, H., Ye, C.: On the equitable vertex arboricity of complete bipartite graphs. Util. Math. 99, 403\u2013411 (2016)","journal-title":"Util. Math."},{"key":"2935_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2016.08.007","volume":"117","author":"KM Nakprasit","year":"2017","unstructured":"Nakprasit, K.M., Nakprasit, K.: The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. Inf. Process. Lett. 117, 40\u201344 (2017)","journal-title":"Inf. Process. Lett."},{"key":"2935_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.tcs.2020.12.020","volume":"857","author":"B Niu","year":"2021","unstructured":"Niu, B., Li, B., Zhang, X.: Hardness and algorithms of equitable tree-coloring problem in chordal graphs. Theor. Comput. Sci. 857, 8\u201315 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2935_CR13","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1080\/00207160.2015.1023794","volume":"93","author":"F Tao","year":"2016","unstructured":"Tao, F., Lin, W.: On the equitable vertex arboricity of graphs. Int. J. Comput. Math. 93(6), 844\u2013853 (2016)","journal-title":"Int. J. Comput. Math."},{"issue":"23","key":"2935_CR14","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1016\/j.disc.2013.08.006","volume":"313","author":"J-L Wu","year":"2013","unstructured":"Wu, J.-L., Zhang, X., Li, H.: Equitable vertex arboricity of graphs. Discrete Math. 313(23), 2696\u20132701 (2013)","journal-title":"Discrete Math."},{"key":"2935_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2021.04.010","volume":"871","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Zhang, X.: Theoretical aspects of equitable partition of networks into sparse modules. Theor. Comput. Sci. 871, 51\u201361 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2935_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.11650\/tjm.19.2015.4422","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X.: Equitable vertex arboricity of planar graphs. Taiwan. J. Math. 19(1), 123\u2013131 (2015)","journal-title":"Taiwan. J. Math."},{"issue":"2","key":"2935_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2298\/FIL1602373Z","volume":"30","author":"X Zhang","year":"2016","unstructured":"Zhang, X.: Equitable list point arboricity of graphs. Filomat 30(2), 373\u2013378 (2016)","journal-title":"Filomat"},{"issue":"6","key":"2935_CR18","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1016\/j.disc.2016.02.003","volume":"339","author":"X Zhang","year":"2016","unstructured":"Zhang, X.: Equitable vertex arboricity of subcubic graphs. Discrete Math. 339(6), 1724\u20131726 (2016)","journal-title":"Discrete Math."},{"key":"2935_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, X., Niu, B., Li, Y.,\u00a0Li, B.: Equitable vertex arboricity conjecture holds for graphs with low degeneracy. Acta Math. Sin., Engl. Ser., 37(8):1293\u20131302, (2021)","DOI":"10.1007\/s10114-021-0663-4"},{"issue":"1","key":"2935_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.2298\/FIL1401217Z","volume":"28","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Wu, J.-L.: A conjecture on equitable vertex arboricity of graphs. Filomat 28(1), 217\u2013219 (2014)","journal-title":"Filomat"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02935-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02935-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02935-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T17:19:05Z","timestamp":1757179145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02935-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,31]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2935"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02935-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,5,31]]},"assertion":[{"value":"23 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 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":"72"}}