@article{Bu2022, 
author = {Yuehua Bu and Qi Jia and Hongguo Zhu and Junlei Zhu},
title = {Acyclic edge coloring of planar graphs},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {6},
pages = {10828-10841},
keywords = {acyclic edge coloring, planar graph, cycle, girth, maximum degree},
url = {https://www.sciopen.com/article/10.3934/math.2022605},
doi = {10.3934/math.2022605},
abstract = {An acyclic edge coloring of a graph    G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of    G, denoted by        χ          a                              ′              (  G  ), is the smallest integer    k such that    G is acyclically edge    k-colorable. In this paper, we consider the planar graphs without 3-cycles and intersecting 4-cycles, and prove that        χ          a                              ′              (  G  )  ≤  Δ  (  G  )  +  1 if    Δ  (  G  )  ≥  8.}
}