Two-Face-Colourable maps

We consider the following problem. We are given a plane graph G = (V, E). What is the smallest number of edges that we have to add to G to make it two-face-colourable? We show that a plane graph is two-face-colourable if and only if its inner vertices all have even degree. We present an algorithm that solves this problem in polynomial time.