An equitable k-partition of a graph G is collection induced subgraphs (G[V1],G[V2],…,G[Vk]) such that (V1,V2,…,Vk) partition V(G) and −1≤|Vi|−|Vj|≤1 for all 1≤i<j≤k. We prove every planar admits an 2-partition into 3-degenerate graphs, 3-partition 2-degenerate two forests one graph.