{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:48:42Z","timestamp":1759042122788,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People\u2019s Republic of China","doi-asserted-by":"publisher","award":["G2022040004L","G2023016016L"],"award-info":[{"award-number":["G2022040004L","G2023016016L"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSERC Canada"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601111"],"award-info":[{"award-number":["11601111"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ15A010010"],"award-info":[{"award-number":["LQ15A010010"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01165-3","type":"journal-article","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T12:01:42Z","timestamp":1714219302000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Planar graphs are acyclically edge $$(\\Delta + 5)$$-colorable"],"prefix":"10.1007","volume":"47","author":[{"given":"Qiaojun","family":"Shu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-3396","authenticated-orcid":false,"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"key":"1165_CR1","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 (1991) Acyclic coloring of graphs. Random Struct Algorithms 2:277\u2013288","journal-title":"Random Struct Algorithms"},{"key":"1165_CR2","doi-asserted-by":"publisher","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\u2013167","journal-title":"J Graph Theory"},{"key":"1165_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/jgt.20650","volume":"71","author":"LD Andersen","year":"2012","unstructured":"Andersen LD, M\u00e1\u010dajov\u00e1 E, Maz\u00e1k J (2012) Optimal acyclic edge-coloring of cubic graphs. J Graph Theory 71:353\u2013364","journal-title":"J Graph Theory"},{"key":"1165_CR4","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1002\/jgt.20376","volume":"61","author":"M Basavaraju","year":"2009","unstructured":"Basavaraju M, Chandran LS (2009) Acyclic edge coloring of graphs with maximum degree $$4$$. J Graph Theory 61:192\u2013209","journal-title":"J Graph Theory"},{"key":"1165_CR5","doi-asserted-by":"publisher","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-coloring of planar graphs. SIAM J Discret Math 25:463\u2013478","journal-title":"SIAM J Discret Math"},{"key":"1165_CR6","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1137\/17M1158355","volume":"33","author":"DW Cranston","year":"2019","unstructured":"Cranston DW (2019) Acyclic edge-coloring of planar graphs: $$\\delta $$ colors suffice when $$\\delta $$ is large. SIAM J Discret Math 33:614\u2013628","journal-title":"SIAM J Discret Math"},{"key":"1165_CR7","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.ejc.2013.02.007","volume":"34","author":"L Esperet","year":"2013","unstructured":"Esperet L, Parreau A (2013) Acyclic edge-coloring using entropy compression. Eur J Comb 34:1019\u20131027","journal-title":"Eur J Comb"},{"key":"1165_CR8","first-page":"139","volume":"28","author":"J Fiamcik","year":"1978","unstructured":"Fiamcik J (1978) The acyclic chromatic class of a graph. Math Slovaca 28:139\u2013145","journal-title":"Math Slovaca"},{"key":"1165_CR9","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2016.12.011","volume":"665","author":"I Giotis","year":"2017","unstructured":"Giotis I, Kirousis L, Psaromiligkos KI, Thilikos DM (2017) Acyclic edge coloring through the lov\u00e1sz local lemma. Theoret Comput Sci 665:40\u201350","journal-title":"Theoret Comput Sci"},{"key":"1165_CR10","doi-asserted-by":"crossref","unstructured":"Molloy M, Reed B (1998) Further algorithmic aspects of the local lemma. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC\u201998), pp 524\u2013529","DOI":"10.1145\/276698.276866"},{"key":"1165_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejc.2011.12.002","volume":"33","author":"S Ndreca","year":"2012","unstructured":"Ndreca S, Procacci A, Scoppola B (2012) Improved bounds on coloring of graphs. Eur J Comb 33:592\u2013609","journal-title":"Eur J Comb"},{"key":"1165_CR12","doi-asserted-by":"crossref","unstructured":"Shu Q, Chen Y, Han S, Lin G, Miyano E, Zhang A (2020) Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. In: Proceedings of the 16th International Conference on Theory and Applications of Models of Computation (TAMC 2020), LNCS 12337, pp 426\u2013438","DOI":"10.1007\/978-3-030-59267-7_36"},{"key":"1165_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2021.06.017","volume":"882","author":"Q Shu","year":"2021","unstructured":"Shu Q, Chen Y, Han S, Lin G, Miyano E, Zhang A (2021) Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theoret Comput Sci 882:77\u2013108","journal-title":"Theoret Comput Sci"},{"key":"1165_CR14","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.dam.2011.12.016","volume":"160","author":"Q Shu","year":"2012","unstructured":"Shu Q, Wang W, Wang Y (2012) Acyclic edge coloring of planar graphs without $$5$$-cycles. Discret Appl Math 160:1211\u20131223","journal-title":"Discret Appl Math"},{"key":"1165_CR15","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1002\/jgt.21683","volume":"73","author":"Q Shu","year":"2013","unstructured":"Shu Q, Wang W, Wang Y (2013) Acyclic chromatic indices of planar graphs with girth at least $$4$$. J Graph Theory 73:386\u2013399","journal-title":"J Graph Theory"},{"key":"1165_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s40840-017-0484-x","volume":"42","author":"Q Shu","year":"2019","unstructured":"Shu Q, Wang Y, Ma Y, Wang W (2019) Acyclic edge coloring of $$4$$-regular graphs without 3-cycles. Bull Malays Math Sci Soc 42:285\u2013296","journal-title":"Bull Malays Math Sci Soc"},{"key":"1165_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","volume":"92","author":"S Skulrattankulchai","year":"2004","unstructured":"Skulrattankulchai S (2004) Acyclic colorings of subcubic graphs. Inf Process Lett 92:161\u2013167","journal-title":"Inf Process Lett"},{"key":"1165_CR18","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a $$p$$-graph. Discret Analiz 3:25\u201330","journal-title":"Discret Analiz"},{"key":"1165_CR19","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.dam.2015.07.015","volume":"201","author":"T Wang","year":"2016","unstructured":"Wang T, Zhang Y (2016) Further result on acyclic chromatic index of planar graphs. Discret Appl Math 201:228\u2013247","journal-title":"Discret Appl Math"},{"key":"1165_CR20","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1007\/s40840-017-0592-7","volume":"42","author":"W Wang","year":"2019","unstructured":"Wang W, Ma Y, Shu Q, Wang Y (2019) Acyclic edge coloring of $$4$$-regular graphs (ii). Bull Malays Math Sci Soc 42:2047\u20132054","journal-title":"Bull Malays Math Sci Soc"},{"key":"1165_CR21","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/s10878-012-9474-y","volume":"25","author":"W Wang","year":"2013","unstructured":"Wang W, Shu Q, Wang Y (2013) Acyclic edge coloring of planar graphs without $$4$$-cycles. J Comb Optim 25:562\u2013586","journal-title":"J Comb Optim"},{"key":"1165_CR22","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ejc.2012.07.008","volume":"34","author":"W Wang","year":"2013","unstructured":"Wang W, Shu Q, Wang Y (2013) A new upper bound on the acyclic chromatic indices of planar graphs. Eur J Comb 34:338\u2013354","journal-title":"Eur J Comb"},{"key":"1165_CR23","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/s10878-014-9765-6","volume":"28","author":"Y Wang","year":"2014","unstructured":"Wang Y, Shu Q, Wu J-L, Zhang W (2014) Acyclic edge coloring of planar graphs without a $$3$$-cycle adjacent to a $$6$$-cycle. J Comb Optim 28:692\u2013715","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01165-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01165-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01165-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:11:05Z","timestamp":1715951465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01165-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01165-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"31 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"64"}}