For a proper edge coloring of a simple graphG，if any two edges which are adjacent to a same edge have different colors，then，it is a strong edge coloring of G. The minimum number of colors of any strong edge colorings of G is the strong chromatic number of G. In this paper，by using discharging method，we proved that the strong chromatic number for planar graphs with even maximum degree which is at least 6 and without 3 cycles is no more than 5Δ2/4，furthermore，we proved that 20 is an upper bound of the strong chromatic number of planar graphs with maximum degree 4 and girth at least 5.