Find an efficient algorithm for determining whether any given planar graph is 3 colorable.