{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:23:56Z","timestamp":1763641436791},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00373-011-1043-0","type":"journal-article","created":{"date-parts":[[2011,3,30]],"date-time":"2011-03-30T20:18:39Z","timestamp":1301516319000},"page":"215-226","source":"Crossref","is-referenced-by-count":8,"title":["Acyclic Edge Coloring of Planar Graphs Without Small Cycles"],"prefix":"10.1007","volume":"28","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,1]]},"reference":[{"key":"1043_CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/rsa.3240020403","volume":"2","author":"N. Alon","year":"1991","unstructured":"Alon N.: A parallel algorithmic version of the Local Lemma. Random Struct. Algorithms 2, 367\u2013378 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"1043_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.1010","volume":"37","author":"N. Alon","year":"2001","unstructured":"Alon N., Sudakov B., Zaks A.: Acyclic edge colorings of graphs. J. Graph Theory 37, 157\u2013167 (2001)","journal-title":"J. Graph Theory"},{"key":"1043_CR3","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s00453-001-0093-8","volume":"32","author":"N. Alon","year":"2002","unstructured":"Alon N., Zaks A.: Algorithmic aspects of acyclic edge colorings. Algorithmica 32, 611\u2013614 (2002)","journal-title":"Algorithmica"},{"key":"1043_CR4","doi-asserted-by":"crossref","first-page":"6650","DOI":"10.1016\/j.disc.2007.12.036","volume":"308","author":"M. Basavaraju","year":"2008","unstructured":"Basavaraju M., Chandran L.S.: Acyclic edge coloring of subcubic graphs. Discret. Math. 308, 6650\u20136653 (2008)","journal-title":"Discret. Math."},{"key":"1043_CR5","doi-asserted-by":"crossref","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 colorings of planar graphs. Discret. Math. 25, 211\u2013236 (1979)","journal-title":"Discret. Math."},{"key":"1043_CR6","unstructured":"Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring (in Russian), Soob\u0161\u010d Akad Nauk Gruzin SSR 93, 21\u201324 (1979) (Georgian and English summaries)"},{"key":"1043_CR7","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ipl.2008.07.016","volume":"108","author":"A. Fiedorowicz","year":"2008","unstructured":"Fiedorowicz A., Ha\u0142uszczak M., Narayanan N.: About acyclic edge colourings of planar graphs. Inform. Process. Lett. 108, 412\u2013417 (2008)","journal-title":"Inform. Process. Lett."},{"key":"1043_CR8","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fc B.: Acyclic colorings of planar graphs. Israel J. Math. 14, 390\u2013408 (1973)","journal-title":"Israel J. Math."},{"key":"1043_CR9","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.dam.2010.12.019","volume":"159","author":"J. Hou","year":"2011","unstructured":"Hou J., Liu G., Wang G.: Improved bounds for acyclic chromatic index of planar graphs. Discret. Appl. Math. 159, 876\u2013881 (2011)","journal-title":"Discret. Appl. Math."},{"key":"1043_CR10","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11425-008-0124-x","volume":"52","author":"J. Hou","year":"2009","unstructured":"Hou J., Wu J., Liu G., Liu B.: Acyclic edge colorings of planar graphs and series-parallel graphs. Sci. Chin. A 52, 605\u2013616 (2009)","journal-title":"Sci. Chin. A"},{"key":"1043_CR11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1002\/jgt.20436","volume":"64","author":"J. Hou","year":"2010","unstructured":"Hou J., Wu J., Liu G., Liu B.: Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64, 22\u201336 (2010)","journal-title":"J. Graph Theory"},{"key":"1043_CR12","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0012-365X(76)90075-3","volume":"14","author":"A.K. Kostochka","year":"1976","unstructured":"Kostochka A.K., Mel\u2019nikov L.S.: Note to the paper of Gr\u00fcnbaum on acyclic colorings. Discret. Math. 14, 403\u2013406 (1976)","journal-title":"Discret. Math."},{"key":"1043_CR13","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Further Algorithmic Aspects of the Local Lemma. In: Proceedings of the 30th annual ACM Symposium on theory of computing, 524\u2013529 (1998)","DOI":"10.1145\/276698.276866"},{"key":"1043_CR14","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/11809678_38","volume":"4112","author":"R. Muthu","year":"2006","unstructured":"Muthu R., Narayanan N., Subramanian C.R.: Optimal acyclic edge colouring of grid like graphs. Lect. Notes Comp. Sci. 4112, 360\u2013367 (2006)","journal-title":"Lect. Notes Comp. Sci."},{"key":"1043_CR15","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-72870-2_14","volume":"4508","author":"R. Muthu","year":"2007","unstructured":"Muthu R., Narayanan N., Subramanian C.R.: Acyclic edge colouring of outerplanar graphs. Lect. Notes Comp. Sci. 4508, 144\u2013152 (2007)","journal-title":"Lect. Notes Comp. Sci."},{"key":"1043_CR16","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.: Acyclic colorings of subcubic graphs. Inform. Process. Lett. 92, 161\u2013167 (2004)","journal-title":"Inform. Process. Lett."},{"key":"1043_CR17","doi-asserted-by":"crossref","first-page":"5196","DOI":"10.1016\/j.tcs.2009.08.015","volume":"410","author":"D. Yu","year":"2009","unstructured":"Yu D., Hou J., Liu G., Liu B., Xu L.: Acyclic edge coloring of planar graphs with large girth. Theor. Comp. Sci. 410, 5196\u20135200 (2009)","journal-title":"Theor. Comp. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1043-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1043-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1043-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T17:39:59Z","timestamp":1637429999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1043-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["1043"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1043-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}