Acyclic edge coloring of some planar graphs
Jianliang Wu · Journal of Shandong University · 2008
If a planar graph G contains no i-cycles,i=3,5,and any two 4-cycles have no common edge,then the acyclic edge coloring conjecture holds.And if a planar graph G contains no 3-cycles and any two 4-cycles have no common vertex,then acyclic edge chromatic number of G is at most Δ(G)+3.