{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:25:57Z","timestamp":1763641557106},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T00:00:00Z","timestamp":1342137600000},"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":[[2014,4]]},"DOI":"10.1007\/s10878-012-9524-5","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T17:46:46Z","timestamp":1342201606000},"page":"519-529","source":"Crossref","is-referenced-by-count":4,"title":["Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles"],"prefix":"10.1007","volume":"27","author":[{"given":"Yingqian","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ping","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,13]]},"reference":[{"key":"9524_CR1","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 (2001) Acyclic edge-colorings of graphs. J Graph Theory 37:157\u2013C167","journal-title":"J Graph Theory"},{"key":"9524_CR2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/090776676","volume":"25","author":"M Basavaraju","year":"2011","unstructured":"Basavaraju M, Chandran LS, Cohen N, Havet F, M\u00fcller T (2011) Acyclic edge-colouring of planar graphs. SIAM J Discrete Math 25:463\u2013478","journal-title":"SIAM J Discrete Math"},{"key":"9524_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, Berlin"},{"key":"9524_CR4","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1016\/j.disc.2009.06.007","volume":"310","author":"M Borowiecki","year":"2010","unstructured":"Borowiecki M, Fiedorowicz A (2010) Acyclic edge colouring of planar graphs without short cycles. Discrete Math 310:1445\u20131455","journal-title":"Discrete Math"},{"key":"9524_CR5","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ipl.2010.07.019","volume":"110","author":"W Dong","year":"2010","unstructured":"Dong W, Xu B (2010) Some results on acyclic edge coloring of plane graphs. Inf Process Lett 110:887\u2013892","journal-title":"Inf Process Lett"},{"key":"9524_CR6","first-page":"139","volume":"28","author":"J Fiam\u010d\u00edk","year":"1978","unstructured":"Fiam\u010d\u00edk J (1978) The acyclic chromatic class of a graph. Math Slovaca 28:139\u2013145","journal-title":"Math Slovaca"},{"key":"9524_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 (2008) About acyclic edge colourings of planar graphs. Inf Process Lett 108:412\u2013417","journal-title":"Inf Process Lett"},{"key":"9524_CR8","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.ipl.2011.05.023","volume":"111","author":"J Hou","year":"2011","unstructured":"Hou J, Roussel N, Wu J (2011) Acyclic chromatic index of planar graphs with triangles. Inf Process Lett 111:836\u2013840","journal-title":"Inf Process Lett"},{"key":"9524_CR9","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11425-008-0124-x","volume":"51","author":"J Hou","year":"2009","unstructured":"Hou J, Wu J, Liu G, Liu B (2009) Acyclic edge colorings of planar graphs and series-parallel graphs. Sci China Ser A 51:605\u2013616","journal-title":"Sci China Ser A"},{"key":"9524_CR10","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1016\/j.disc.2011.07.023","volume":"311","author":"P Sheng","year":"2011","unstructured":"Sheng P, Wang Y (2011) On acyclic edge colorings of planar graphs without intersecting triangles. Discrete Math 311:2490\u20132495","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9524-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9524-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9524-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9524-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,13]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9524"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9524-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,13]]}}}