{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:35Z","timestamp":1759063595072,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T00:00:00Z","timestamp":1605052800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071265","11771443"],"award-info":[{"award-number":["12071265","11771443"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2017QF011"],"award-info":[{"award-number":["ZR2017QF011"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001481"],"award-info":[{"award-number":["12001481"]}],"id":[{"id":"10.13039\/501100001809","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":[[2021,3]]},"DOI":"10.1007\/s00373-020-02254-w","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T07:02:56Z","timestamp":1605078176000},"page":"455-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Acyclic Coloring of Graphs with Maximum Degree 7"],"prefix":"10.1007","volume":"37","author":[{"given":"Juan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianying","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"2254_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N Alon","year":"1991","unstructured":"Alon, N., Mcdiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Struct. Algor. 2, 277\u2013288 (1991)","journal-title":"Random Struct. Algor."},{"key":"2254_CR2","first-page":"21","volume":"93","author":"MI Burstein","year":"1979","unstructured":"Burstein, M.I.: Every 4-valent graph has an acyclic 5-coloring (in Russian). Soob\u0161\u010d. Akad. Nauk Gruzin SSR 93, 21\u201324 (1979)","journal-title":"Soob\u0161\u010d. Akad. Nauk Gruzin SSR"},{"key":"2254_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, New York, Inc (1998)"},{"key":"2254_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"OV Borodin","year":"1979","unstructured":"Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25, 211\u2013236 (1979)","journal-title":"Discrete Math."},{"key":"2254_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0607026","volume":"7","author":"TF Coleman","year":"1986","unstructured":"Coleman, T.F., Cai, J.Y.: The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Algebr. Discrete Methods 7, 221\u2013235 (1986)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"2254_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/s10255-018-0791-5","volume":"34","author":"J Cai","year":"2018","unstructured":"Cai, J., Zhu, X.: Improved upper bound for generalized acyclic chromatic number of graphs. Acta Math. Appl. Sinica English Ser. 34, 798\u2013800 (2018)","journal-title":"Acta Math. Appl. Sinica English Ser."},{"key":"2254_CR7","unstructured":"Dieng, Y., Hocquard, H., Naserasr, R.: Acyclic coloring of graphs with maximum degree bounded. In: Proc. European conference on Combinatorics, Graph Theory and Applications (2010)"},{"key":"2254_CR8","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34, 553\u2013579 (2005)","journal-title":"SIAM J. Comput."},{"key":"2254_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.7151\/dmgt.1665","volume":"33","author":"A Fiedorowicz","year":"2013","unstructured":"Fiedorowicz, A.: Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree. Discuss. Math. Graph Theory 33, 91\u201399 (2013)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2254_CR10","doi-asserted-by":"crossref","unstructured":"Fertin, G., Raspaud, A.: Acyclic coloring of graphs of maximum degree $$\\Delta $$, In: Proc. European Conference on Combinatorics, Graph Theory and Applications, 2005, pp. 389\u2013396 (2005)","DOI":"10.46298\/dmtcs.3450"},{"key":"2254_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2007.08.022","volume":"105","author":"G Fertin","year":"2008","unstructured":"Fertin, G., Raspaud, A.: Acyclic coloring of graphs of maximum degree five: nine colors are enough. Inform. Process. Lett. 105, 65\u201372 (2008)","journal-title":"Inform. Process. Lett."},{"key":"2254_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(02)00265-X","volume":"84","author":"G Fertin","year":"2002","unstructured":"Fertin, G., Godard, E., Raspaud, A.: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84, 131\u2013139 (2002)","journal-title":"Inf. Process. Lett."},{"key":"2254_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel J. Math. 14, 390\u2013408 (1973)","journal-title":"Israel J. Math."},{"key":"2254_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.1080.0286","volume":"21","author":"AH Gebremedhin","year":"2009","unstructured":"Gebremedhin, A.H., Tarafdar, A., Pothen, A., Walther, A.: Efficient computation of sparse Hessians using coloring and automatic differentiation. Inf. J. Comput. 21, 209\u2013223 (2009)","journal-title":"Inf. J. Comput."},{"key":"2254_CR15","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ipl.2011.05.005","volume":"111","author":"H Hocquard","year":"2011","unstructured":"Hocquard, H.: Graphs with maximum degree 6 are acyclically 11-colorable. Inform. Process. Lett. 111, 748\u2013753 (2011)","journal-title":"Inform. Process. Lett."},{"key":"2254_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.dam.2018.03.014","volume":"244","author":"D Hu","year":"2018","unstructured":"Hu, D., Huang, D., Wang, W., Wu, J.: Planar graphs without chordal 6-cycles are 4-choosable. Discrete Appl. Math. 244, 116\u2013123 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2254_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.26493\/1855-3974.198.541","volume":"4","author":"AV Kostochka","year":"2011","unstructured":"Kostochka, A.V., Stocker, C.: Graphs with maximum degree 5 are acyclically 7-colorable. Ars Math. Contemp. 4, 153\u2013164 (2011)","journal-title":"Ars Math. Contemp."},{"key":"2254_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.7151\/dmgt.1408","volume":"28","author":"S \u0160pacapan","year":"2008","unstructured":"\u0160pacapan, S., Horvat, A.: On acyclic colorings of direct products, Discuss. Math. Graph Theory 28, 323\u2013333 (2008)","journal-title":"Math. Graph Theory"},{"key":"2254_CR19","doi-asserted-by":"publisher","first-page":"3025","DOI":"10.1016\/j.disc.2019.06.012","volume":"342","author":"J Wang","year":"2019","unstructured":"Wang, J., Miao, L.: Acyclic coloring of graphs with maximum degree at most six. Discrete Math. 342, 3025\u20133033 (2019)","journal-title":"Discrete Math."},{"key":"2254_CR20","first-page":"11584","volume":"343","author":"J Wang","year":"2020","unstructured":"Wang, J., Miao, L., Song, W.: Acyclic L-coloring of graphs with maximum degrees 5 and 6. Discrete Math. 343, 11584 (2020)","journal-title":"Discrete Math."},{"key":"2254_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.endm.2009.11.030","volume":"35","author":"K Yadav","year":"2009","unstructured":"Yadav, K., Varagani, S., Kothapalli, K., Venkaiah, V.C.: Acyclic vertex coloring of graphs of maximum degree 6. Electron. Notes Discrete Math. 35, 177\u2013182 (2009)","journal-title":"Electron. Notes Discrete Math."},{"key":"2254_CR22","doi-asserted-by":"crossref","unstructured":"Yadav, K., Varagani, S., Kothapalli, K., Venkaiah, V.C.: Acyclic vertex coloring of graphs of maximum degree $$\\Delta $$, In: Proc. Indian Mathematical Society (2009)","DOI":"10.1016\/j.endm.2009.11.030"},{"key":"2254_CR23","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.disc.2010.10.024","volume":"311","author":"K Yadav","year":"2011","unstructured":"Yadav, K., Varagani, S., Kothapalli, K., Venkaiah, V.C.: Acyclic vertex coloring of graphs of maximum degree 5. Discrete Math. 311, 342\u2013348 (2011)","journal-title":"Discrete Math."},{"key":"2254_CR24","doi-asserted-by":"publisher","first-page":"111623","DOI":"10.1016\/j.disc.2019.111623","volume":"342","author":"W Yang","year":"2019","unstructured":"Yang, W., Wang, W., Wang, Y.: Acyclic coloring of IC-planar graphs. Discrete Math. 342, 111623 (2019)","journal-title":"Discrete Math."},{"key":"2254_CR25","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s10878-016-0108-7","volume":"34","author":"X Zhang","year":"2017","unstructured":"Zhang, X.: Disconnected $$g_c $$-critical graphs. J. Comb. Optim. 34, 771\u2013780 (2017)","journal-title":"J. Comb. Optim."},{"key":"2254_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.disc.2014.01.022","volume":"325","author":"Y Zhao","year":"2014","unstructured":"Zhao, Y., Miao, L., Pang, S., Song, W.: Acyclic vertex coloring of graphs of maximum degree six. Discrete Math. 325, 17\u201322 (2014)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02254-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02254-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02254-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T17:09:28Z","timestamp":1669568968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02254-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,11]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2254"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02254-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,11,11]]},"assertion":[{"value":"5 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}