{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:48:22Z","timestamp":1754110102793},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_21","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"239-248","source":"Crossref","is-referenced-by-count":3,"title":["Acyclic Choosability of Graphs with Small Maximum Degree"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gon\u00e7alves","sequence":"first","affiliation":[]},{"given":"Micka\u00ebl","family":"Montassier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02759792","volume":"28","author":"M.O. Albertson","year":"1977","unstructured":"Albertson, M.O., Berman, D.M.: Every planar graph has an acyclic 7-coloring. Israel J. Math.\u00a0(28), 169\u2013174 (1977)","journal-title":"Israel J. Math."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.10035","volume":"40","author":"O.V. Borodin","year":"2002","unstructured":"Borodin, O.V., Fon-Der Flaass, D.G., Kostochka, A.V., Raspaud, A., Sopena, E.: Acyclic list 7-coloring of planar graphs. J. Graph Theory\u00a040(2), 83\u201390 (2002)","journal-title":"J. Graph Theory"},{"issue":"60","key":"21_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1112\/S0024610799007942","volume":"2","author":"O.V. Borodin","year":"1999","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Acyclic colourings of planar graphs with large girth. J. London Math. Soc.\u00a02(60), 344\u2013352 (1999)","journal-title":"J. London Math. Soc."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"O.V. Borodin","year":"1979","unstructured":"Borodin, O.V.: On acyclic coloring of planar graphs. Discrete Math.\u00a025, 211\u2013236 (1979)","journal-title":"Discrete Math."},{"issue":"1","key":"21_CR5","first-page":"21","volume":"93","author":"M.I. Burstein","year":"1979","unstructured":"Burstein, M.I.: Every 4-valent graph has an acyclic 5-colouring. Bulletin of the Academy of Sciences of the Georgian SSR\u00a093(1), 21\u201324 (1979) (In Russian)","journal-title":"Bulletin of the Academy of Sciences of the Georgian SSR"},{"key":"21_CR6","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.\u00a014, 390\u2013408 (1973)","journal-title":"Israel J. Math."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0012-365X(76)90075-3","volume":"14","author":"A.V. Kostochka","year":"1976","unstructured":"Kostochka, A.V., Mel\u2019nikov, L.S.: Note to the paper of Gr\u00fcnbaum on acyclic colorings. Discrete Math.\u00a014, 403\u2013406 (1976)","journal-title":"Discrete Math."},{"key":"21_CR8","first-page":"40","volume":"28","author":"A.V. Kostochka","year":"1976","unstructured":"Kostochka, A.V.: Acyclic 6-coloring of planar graphs. Metody Diskret. Anal.\u00a0(28), 40\u201356 (1976) (In Russian)","journal-title":"Metody Diskret. Anal."},{"key":"21_CR9","unstructured":"Kostochka, A.V.: Upper bounds of chromatic functions of graphs. PhD thesis, Novosibirsk (1978)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1215\/S0012-7094-74-04119-2","volume":"41","author":"J. Mitchem","year":"1974","unstructured":"Mitchem, J.: Every planar graph has an acyclic 8-coloring. Duke Math. J.\u00a041, 177\u2013181 (1974)","journal-title":"Duke Math. J."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Montassier, M., Ochem, P., Raspaud, A.: On the acyclic choosability of graphs. Journal of Graph Theory (2005) (to appear)","DOI":"10.1002\/jgt.20134"},{"key":"21_CR12","unstructured":"Montassier, M., Serra, O.: Acyclic choosability and probabilistic methods. Technical report, Manuscript (2004)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Ochem, P.: Negative results on acyclic improper colorings Manuscript (2005)","DOI":"10.46298\/dmtcs.3441"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is 5-choosable. J. Combin. Theory Ser. B\u00a062, 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","volume":"120","author":"M. Voigt","year":"1993","unstructured":"Voigt, M.: List colourings of planar graphs. Discrete Math.\u00a0120, 215\u2013219 (1993)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T19:08:47Z","timestamp":1683313727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11604686_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}