# KBSE60

Theorem. PLANAR-3-COLORABILITY ≣ P PLANAR-MAP-3-COLORABILITY.(A plane three-coloring problem can be mutually regulated with a plane graph three-coloring problem!) Proof 2.Planar 3-colorability is NP-completeprove:a. First prove that it is an NP problem. It is a good proof as long as we find one of the solutions in polynomial time.b. We can reduce the 3-colorability problem to the flat 3-colorability problem.c. Given any 3 coloring instance G, … Continue reading KBSE60