Acyclic Edge Coloring of Planar Graphs Without Intersecting Triangles

Given that a proper edge coloring of G contains no bichromatic cycles inG, then it is an acyclic edge coloring of G. The acyclic chromatic number of G is the minimum number of colors among all the acyclic edge colorings of G. In order to study the upper bound of acyclic chromatic number of planar graphs, by using discharging methods and some properties of planar graphs, the paper has proved that if G is a planar graph without intersecting triangles, then its acyclic chromatic number will be not more than G.