Reformulated Problem: Every planar graph can have its vertices colored so that no adjacent vertices have the same color using no more than four colors.
Kuratowski's Theorem: A graph is planar if and only if it has no subgraph homeomorphic to K5 or K3,3.
Def: k-colorable, chromatic number.
König's Theorem (1936): A graph is 2-colorable iff it has no circuits of odd length.
Proof of König's Theorem: Let d(x,v) be the length of the shortest chain between x and v (note it must be simple). If x is colored blue (the first vertex picked in the algorithm), then for each red colored vertex u, we must have d(x,u) odd, while for each blue colored vertex v, we will have d(x,v) even.
Suppose that two neighbors, u and v, get the same color. Then d(x,u) and d(x,v) have the same parity (both odd or both even). The closed chain x - u - v - x is therefore of odd length. If this closed chain is not simple, we can make it simple by removing edges, but this always reduces the number of edges by an even number. When we are finished "pruning" the chain, we will be left with a circuit of odd length.
There are numerous problems that can be answered by appropriately coloring a graph. For instance, scheduling problems, committee assignments, broadcast channel assignments, garbage truck routes.