{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:27:35Z","timestamp":1754108855400},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,24]],"date-time":"2013-04-24T00:00:00Z","timestamp":1366761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10878-013-9619-7","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T08:25:13Z","timestamp":1366705513000},"page":"713-722","source":"Crossref","is-referenced-by-count":2,"title":["The $$r$$ r -acyclic chromatic number of planar graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Guanghui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Guiying","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,24]]},"reference":[{"issue":"4","key":"9619_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson G, Halld\u00f3rsson MM (2003) Coloring powers of planar graphs. SIAM J Discret Math 16(4):651\u2013662","journal-title":"SIAM J Discret Math"},{"key":"9619_CR2","unstructured":"Albertson MO, Berman DM (1976) The acyclic chromatic number. In Proceedings of Seventh Southeastern Conference on Combinatorics. Graph Theory and Computing, Utilitas Mathematicsa Inc., Winniper, pp 51\u201360"},{"key":"9619_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N Alon","year":"1991","unstructured":"Alon N, McDiarmid C, Reed B (1991) Acyclic coloring of graphs. Random Struct Algorithms 2:277\u2013288","journal-title":"Random Struct Algorithms"},{"key":"9619_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan Press[M], New York"},{"key":"9619_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"OV Borodin","year":"1979","unstructured":"Borodin OV (1979) On acyclic colorings of planar graphs. Discret Math 25:211\u2013236","journal-title":"Discret Math"},{"key":"9619_CR6","first-page":"87","volume":"14","author":"OV Borodin","year":"1995","unstructured":"Borodin OV, Woodall DR (1995) Thirteen coloring numbers of outerplane graphs. Bull Inst Combin Appl 14:87\u2013100","journal-title":"Bull Inst Combin Appl"},{"key":"9619_CR7","first-page":"21","volume":"93","author":"MI Burnstein","year":"1979","unstructured":"Burnstein MI (1979) Every 4-valent graph has an acyclic $$5$$ 5 -coloring. Soobsc Akad Nauk Grucin 93:21\u201324 (in Russian)","journal-title":"Soobsc Akad Nauk Grucin"},{"issue":"1","key":"9619_CR8","first-page":"27","volume":"56","author":"J Cai","year":"2013","unstructured":"Cai J, Wang G, Yan G (2013) The generalized acyclic chromatic number of graphs with large girth. Acta Math Sinica 56(1):27\u201330","journal-title":"Acta Math Sinica"},{"key":"9619_CR9","unstructured":"Dieng Y, Hocquard H, Naserasr R (2010) Acyclic colorings of graph with maximum degree. LaBRI, Manuscript"},{"key":"9619_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"J Duffin","year":"1965","unstructured":"Duffin J (1965) Topology of series-parallel networks. J Math Anal Appl 10:303\u2013318","journal-title":"J Math Anal Appl"},{"key":"9619_CR11","doi-asserted-by":"crossref","unstructured":"Fertin G, Raspaud A (2005) Acyclic colorings of graphs of maximum degree $$\\Delta $$ \u0394 , European conference on combinatorics graph theory and applications, pp 389\u2013396","DOI":"10.46298\/dmtcs.3450"},{"key":"9619_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ipl.2007.08.022","volume":"105","author":"G Fertin","year":"2008","unstructured":"Fertin G, Raspaud A (2008) Acyclic colorings of graphs of maximum degree five: nine colors are enough. Inf Process Lett 105:65\u201372","journal-title":"Inf Process Lett"},{"key":"9619_CR13","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00373-005-0635-y","volume":"21","author":"C Greenhill","year":"2005","unstructured":"Greenhill C, Pikhurko O (2005) Bounds on the generalized acyclic chromatic number of bounded degree graphs. Graphs Combin 21:407\u2013419","journal-title":"Graphs Combin"},{"key":"9619_CR14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum B (1973) Acyclic colorings of planar graphs. Israel J Math 14:390\u2013408","journal-title":"Israel J Math"},{"key":"9619_CR15","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ipl.2011.05.005","volume":"111","author":"H Hocquard","year":"2011","unstructured":"Hocquard H (2011) Graphs with maximum degree 6 are acyclically 11-colorabe. Inf Process Lett 111:748\u2013753","journal-title":"Inf Process Lett"},{"key":"9619_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.26493\/1855-3974.198.541","volume":"4","author":"AV Kostochka","year":"2011","unstructured":"Kostochka AV, Stocker C (2011) Graphs with maximum degree 5 are acyclically 7-colorable. Ars Mathematica Contemporanea 4:153\u2013164","journal-title":"Ars Mathematica Contemporanea"},{"key":"9619_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","volume":"92","author":"S Skulrattanakulchai","year":"2004","unstructured":"Skulrattanakulchai S (2004) Acyclic coloring of subcubic graphs. Inf Process Lett 92:161\u2013167","journal-title":"Inf Process Lett"},{"key":"9619_CR18","doi-asserted-by":"crossref","unstructured":"Yadav K, Varagani S, Kothapalli K, Venkaiah VCh (2009) Acyclic vertex coloring of graphs of maximum degree $$\\Delta $$ \u0394 . Proceedings of Indian Mathematical Society","DOI":"10.1016\/j.endm.2009.11.030"},{"key":"9619_CR19","doi-asserted-by":"crossref","first-page":"2048","DOI":"10.1016\/j.dam.2012.04.015","volume":"160","author":"X Zhang","year":"2012","unstructured":"Zhang X, Wang G, Yu Y, Li J, Liu G (2012) On r-acyclic edge colorings of planar graphs. Discret Appl Math 160:2048\u20132053","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9619-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9619-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9619-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T17:04:27Z","timestamp":1644858267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9619-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,24]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9619"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9619-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,24]]}}}