A proper coloring of gragh G meets the set of the vertices of any two colors to induce sub-graph which is the number of disjoint paths and this proper coloring is referred to linear coloring.The number of linear coloring of the graph Gindicates the number of minimum colors in all linear coloring of thr graph G. This paper studies the linear coloring of planar graphs and proves lc(G)≤Δ（G）+14 for the planar graphs with maximum degree Δ being even number.