{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:52Z","timestamp":1759638112025,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T00:00:00Z","timestamp":1455926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010084","name":"Independent Innovation Foundation of Shandong University","doi-asserted-by":"crossref","award":["IFYT 14013"],"award-info":[{"award-number":["IFYT 14013"]}],"id":[{"id":"10.13039\/501100010084","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201406220192"],"award-info":[{"award-number":["201406220192"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271006"],"award-info":[{"award-number":["11271006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471193"],"award-info":[{"award-number":["11471193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004492","name":"National Youth Foundation of China","doi-asserted-by":"publisher","award":["11401386,11501316"],"award-info":[{"award-number":["11401386,11501316"]}],"id":[{"id":"10.13039\/501100004492","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Provincial Natural Science Foundation of China","award":["ZR2014AQ001"],"award-info":[{"award-number":["ZR2014AQ001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10878-016-9997-8","type":"journal-article","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T03:34:07Z","timestamp":1455939247000},"page":"426-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Equitable vertex arboricity of 5-degenerate graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songling","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"9997_CR1","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","volume":"44","author":"G Chartrand","year":"1969","unstructured":"Chartrand G, Kronk HV (1969) The point-arboricity of planar graphs. J Lond Math Soc 44:612\u2013616","journal-title":"J Lond Math Soc"},{"issue":"5","key":"9997_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/eujc.1994.1047","volume":"15","author":"BL Chen","year":"1994","unstructured":"Chen BL, Lih KW, Wu PL (1994) Equitable coloring and the maximum degree. Eur J Combin 15(5):443\u2013447","journal-title":"Eur J Combin"},{"issue":"9","key":"9997_CR3","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1016\/j.disc.2011.05.020","volume":"312","author":"BL Chen","year":"2012","unstructured":"Chen BL, Yen CH (2012) Equitable $$\\Delta $$ \u0394 -coloring of graphs. Discret Math 312(9):1512\u20131517","journal-title":"Discret Math"},{"key":"9997_CR4","first-page":"159","volume-title":"Problem 9. Theory of graphs and its applications","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s P (1964) Problem 9. Theory of graphs and its applications. Czech Acad. Sci. Publ, Prague, p 159"},{"issue":"8","key":"9997_CR5","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/j.disc.2015.03.019","volume":"338","author":"L Esperet","year":"2015","unstructured":"Esperet L, Lemoine L, Maffray F (2015) Equitable partition of graphs into induced forests. Discret Math 338(8):1481\u20131483","journal-title":"Discret Math"},{"key":"9997_CR6","unstructured":"Hajnal A, Szemer\u00e9di (1970) Proof of a conjecture of P. Erd\u0151s. In: Combinatorial theory and its applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), North-Holland, Amsterdam, pp 601\u2013623, 1970"},{"issue":"2","key":"9997_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0963548307008619","volume":"17","author":"HA Kierstead","year":"2008","unstructured":"Kierstead HA, Kostochka AV (2008) A short proof of the Hajnal-Szemer\u00e9di theorem on equitable colouring. Comb Probab Comput 17(2):265\u2013270","journal-title":"Comb Probab Comput"},{"issue":"1","key":"9997_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.20630","volume":"71","author":"HA Kierstead","year":"2012","unstructured":"Kierstead HA, Kostochka AV (2012) Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring. J Graph Theory 71(1):31\u201348","journal-title":"J Graph Theory"},{"key":"9997_CR9","unstructured":"Kronk HV, Mitchem J (1975) Critical point-arboritic graphs. J Lond Math Soc. (2), 9:459\u2013466, 1974\/75"},{"key":"9997_CR10","doi-asserted-by":"crossref","unstructured":"Lih KW, Wu PL (1996) On equitable coloring of bipartite graphs. Discret Math. 151(1\u20133):155\u2013160. Graph theory and combinatorics (Manila, 1991)","DOI":"10.1016\/0012-365X(94)00092-W"},{"key":"9997_CR11","doi-asserted-by":"crossref","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer W (1973) Equitable coloring. Am Math Mon 80:920\u2013922","journal-title":"Am Math Mon"},{"issue":"5","key":"9997_CR12","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/j.disc.2011.11.004","volume":"312","author":"K Nakprasit","year":"2012","unstructured":"Nakprasit K (2012) Equitable colorings of planar graphs with maximum degree at least nine. Discret Math 312(5):1019\u20131024","journal-title":"Discret Math"},{"issue":"23","key":"9997_CR13","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1016\/j.disc.2013.08.006","volume":"313","author":"JL Wu","year":"2013","unstructured":"Wu JL, Zhang X, Li HL (2013) Equitable vertex arboricity of graphs. Discret Math 313(23):2696\u20132701","journal-title":"Discret Math"},{"issue":"2","key":"9997_CR14","first-page":"143","volume":"25","author":"HP Yap","year":"1997","unstructured":"Yap HP, Zhang Y (1997) The equitable $$\\Delta $$ \u0394 -colouring conjecture holds for outerplanar graphs. Bull Inst Math Acad Sin 25(2):143\u2013149","journal-title":"Bull Inst Math Acad Sin"},{"issue":"1","key":"9997_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.11650\/tjm.19.2015.4422","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang X (2015) Equitable vertex arboricity of planar graphs. Taiwan J Math 19(1):123\u2013131","journal-title":"Taiwan J Math"},{"issue":"10\u201311","key":"9997_CR16","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.disc.2011.02.001","volume":"311","author":"X Zhang","year":"2011","unstructured":"Zhang X, Wu JL (2011) On equitable and equitable list colorings of series-parallel graphs. Discret Math 311(10\u201311):800\u2013803","journal-title":"Discret Math"},{"key":"9997_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.2298\/FIL1401217Z","volume":"28","author":"X Zhang","year":"2014","unstructured":"Zhang X, Wu JL (2014) A conjecture on equitable vertex arboricity of graphs. FILOMAT 28:217\u2013219","journal-title":"FILOMAT"},{"key":"9997_CR18","first-page":"97","volume":"27","author":"Y Zhang","year":"1998","unstructured":"Zhang Y, Yap HP (1998) Equitable colorings of planar graphs. J Comb Math Comb Comput 27:97\u2013105","journal-title":"J Comb Math Comb Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-9997-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9997-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9997-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9997-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T13:44:57Z","timestamp":1589636697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-9997-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,20]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9997"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-9997-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,2,20]]}}}