{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:22Z","timestamp":1725544042994},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_11","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"113-124","source":"Crossref","is-referenced-by-count":3,"title":["Acyclically 3-Colorable Planar Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"M.O. Albertson","year":"1973","unstructured":"Albertson, M.O., Berman, D.: Every planar graph has an acyclic 7-coloring. Israel J. Math.\u00a014, 390\u2013408 (1973)","journal-title":"Israel J. Math."},{"issue":"3","key":"11_CR2","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.A.: Acyclic coloring of graphs. Random Struct. Algorithms\u00a02(3), 277\u2013288 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR3","unstructured":"Angelini, P., Frati, F.: Acyclically 3-colorable planar graphs. Tech. Report RT-DIA-147-2009, Dept. of Computer Science and Automation, University of Roma Tre. (2009), http:\/\/web.dia.uniroma3.it\/ricerca\/rapporti\/rt\/2009-147.pdf"},{"issue":"3","key":"11_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is 4-colorable. Part I. Discharging. Illinois J. Math.\u00a021(3), 429\u2013490 (1977)","journal-title":"Illinois J. Math."},{"issue":"3","key":"11_CR5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","volume":"21","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is 4-colorable. Part II. Reducibility. Illinois J. Math.\u00a021(3), 491\u2013567 (1977)","journal-title":"Illinois J. Math."},{"key":"11_CR6","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 colourings of planar graphs. Discr. Math.\u00a025, 211\u2013236 (1979)","journal-title":"Discr. Math."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1112\/S0024610799007942","volume":"60","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.\u00a060(2), 344\u2013352 (1999)","journal-title":"J. London Math. Soc."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On coloring the nodes of a network. Proc. Cambridge Philos. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Philos. Soc."},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci.\u00a01(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","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":"11_CR11","first-page":"40","volume":"28","author":"A.V. Kostochka","year":"1976","unstructured":"Kostochka, A.V.: Acyclic 6-coloring of planar graphs. Metody Diskret. Anal.\u00a028, 40\u201356 (1976)","journal-title":"Metody Diskret. Anal."},{"key":"11_CR12","unstructured":"Kostochka, A.V.: Upper Bounds of Chromatic Functions of Graphs. PhD thesis, University of Novosibirsk, in Russian (1978)"},{"key":"11_CR13","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., Melnikov, L.S.: To the paper of B. Gr\u00fcnbaum on acyclic colorings. Discrete Math.\u00a014, 403\u2013406 (1976)","journal-title":"Discrete Math."},{"key":"11_CR14","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":"11_CR15","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R.: Efficiently four-coloring planar graphs. In: STOC, pp. 571\u2013575 (1996)","DOI":"10.1145\/237814.238005"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","volume":"92","author":"S. Skulrattanakulchai","year":"2004","unstructured":"Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Inf. Proc. Lett.\u00a092(4), 161\u2013167 (2004)","journal-title":"Inf. Proc. Lett."},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput.\u00a011(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR18","first-page":"37","volume":"7","author":"D.R. Wood","year":"2005","unstructured":"Wood, D.R.: Acyclic, star and oriented colourings of graph subdivisions. Discr. Math. Theor. Comp. Sc.\u00a07(1), 37\u201350 (2005)","journal-title":"Discr. Math. Theor. Comp. Sc."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:29Z","timestamp":1606185629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}