Abstract: In order to study the acyclic edge coloring of planar graphs,in this paper,by using discharging methods and some properties of planar graphs,we proved that if G is a planar graph without 4 cycles,then it’s acyclic chromatic number is no more than Δ(G)+6.