Solved: Show that every planar graph G can be colored
Chapter 9, Problem 9.8.36(choose chapter or problem)
Show that every planar graph G can be colored using six or fewer colors. [Hint: Use mathematical induction on the number of vertices of the graph. Apply Corollary 2 of Section 9.7 to find a vertex V with deg(v) :::: 5. Consider the subgraph of G obtained by deleting V and, all edges incident with it.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer