The focus of this thesis is star coloring planar graphs. A star coloring of a planar graph is a proper coloring in which no path on four vertices is colored with just two colors. A graph G is said to be k-star-colorable if G has a star coloring with a . . .