{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:40:22Z","timestamp":1726472422188},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"The Key Programs of Wuxi City College of Vocational Technology","award":["WXCY-2012-GZ-007"]},{"name":"Research Foundation for Advanced Talents of Wuxi City College of Vocational Technology"},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2012LWB46"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11271365"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1016\/j.disc.2014.01.022","type":"journal-article","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T11:46:05Z","timestamp":1393933565000},"page":"17-22","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Acyclic vertex coloring of graphs of maximum degree six"],"prefix":"10.1016","volume":"325","author":[{"given":"Yancai","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Lianying","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Shiyou","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Wenyao","family":"Song","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2014.01.022_br000005","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02759792","article-title":"Every planar graph has an acyclic 7-coloring","volume":"28","author":"Albertson","year":"1977","journal-title":"Israel J. Math."},{"issue":"3","key":"10.1016\/j.disc.2014.01.022_br000010","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/rsa.3240020303","article-title":"Acyclic coloring of graphs","volume":"2","author":"Alon","year":"1991","journal-title":"Random Structures Algorithms"},{"year":"1998","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/j.disc.2014.01.022_br000015"},{"key":"10.1016\/j.disc.2014.01.022_br000020","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","article-title":"On acyclic colorings of planar graphs","volume":"25","author":"Borodin","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.01.022_br000025","first-page":"21","article-title":"Every 4-valent graph has an acyclic 5-coloring","volume":"93","author":"Burstein","year":"1979","journal-title":"Soob.S.C. Akad. Nauk Gruzin. SSR"},{"issue":"1","key":"10.1016\/j.disc.2014.01.022_br000030","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(03)00232-1","article-title":"Acyclic and k-distance coloring of the grid","volume":"87","author":"Fertin","year":"2003","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2014.01.022_br000035","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(02)00265-X","article-title":"Minimum feedback vertex set and acyclic coloring","volume":"84","author":"Fertin","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2014.01.022_br000040","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ipl.2007.08.022","article-title":"Acyclic coloring of graphs of maximum degree five: nine colors are enough","volume":"105","author":"Fertin","year":"2008","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2014.01.022_br000045","doi-asserted-by":"crossref","first-page":"91","DOI":"10.7151\/dmgt.1665","article-title":"Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree","volume":"33","author":"Fiedorowicz","year":"2013","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"10.1016\/j.disc.2014.01.022_br000050","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","article-title":"Acyclic colorings of planar graphs","volume":"14","author":"Gr\u00fcnbaum","year":"1973","journal-title":"Israel J. Math."},{"key":"10.1016\/j.disc.2014.01.022_br000055","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ipl.2011.05.005","article-title":"Graphs with maximum degree 6 are acyclically 11-colorable","volume":"111","author":"Hocquard","year":"2011","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2014.01.022_br000060","first-page":"40","article-title":"Acyclic 6-colorings of planar graphs","volume":"28","author":"Kostochka","year":"1976","journal-title":"Metody Diskret. Anal."},{"key":"10.1016\/j.disc.2014.01.022_br000065","doi-asserted-by":"crossref","first-page":"153","DOI":"10.26493\/1855-3974.198.541","article-title":"Graphs with maximum degree 5 are acyclically 7-colorable","volume":"4","author":"Kostochka","year":"2011","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.disc.2014.01.022_br000070","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1215\/S0012-7094-74-04119-2","article-title":"Every planar graph has an acyclic 8-coloring","volume":"41","author":"Mitchem","year":"1974","journal-title":"Duke Math. J."},{"key":"10.1016\/j.disc.2014.01.022_br000075","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","article-title":"Acyclic colorings of subcubic graphs","volume":"92","author":"Skulrattanakulchai","year":"2004","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2014.01.022_br000080","doi-asserted-by":"crossref","first-page":"323","DOI":"10.7151\/dmgt.1408","article-title":"On acyclic colorings of direct products","volume":"28","author":"S\u02d8pacapan","year":"2008","journal-title":"Discuss. Math. Graph Theory"},{"year":"2001","series-title":"Introduction to Graph Theory","author":"West","key":"10.1016\/j.disc.2014.01.022_br000085"},{"key":"10.1016\/j.disc.2014.01.022_br000090","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.endm.2009.11.030","article-title":"Acyclic vertex coloring of graphs of maximum degree 6","volume":"35","author":"Yadav","year":"2009","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.disc.2014.01.022_br000095","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.disc.2010.10.024","article-title":"Acyclic vertex coloring of graphs of maximum degree 5","volume":"311","author":"Yadav","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.01.022_br000100","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An alorithmic approach to the Lovasz Local Lemma","volume":"2","author":"Beck","year":"1991","journal-title":"Random Structures Algorithms"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X1400034X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X1400034X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T20:34:31Z","timestamp":1589229271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X1400034X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":20,"alternative-id":["S0012365X1400034X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2014.01.022","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Acyclic vertex coloring of graphs of maximum degree six","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2014.01.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}