Is this question wrong?
Let G be a connected planar graph with a planar embedding where every face boundary is a cycle of even length. Prove that G is bipartite.
Consider a graph of 2 squares stacked on top of each other (7 edges, 6 vertices). It is connected, planar and every face boundary is a cycle of even length (4, 4, 6), but is not bipartite.