### Graphs : Coloring Maps

Let G be a cubic plane graph. Prove that the map M(G) is 3-colourable iff each country has an even number of sides. note: if we omit the vertices and edges of a plane graph G from the plane, the remainder falls into connected components, called "faces." Clearly each plane graph has exactly one unbounded face. The boundary