Number of windows in a three- connected cubic bipartite planar graph

A planar graph is one that can be drawn on a two-dimensional plane such that no two edges cross. A cubic graph is one in which all vertices have degree three. A three connected graph is one that cannot be disconnected by removal of two vertices. A graph is bipartite whose vertices can be colored using exactly two colors such that no two adjacent vertices have the same color. In this paper I shall prove that the number of windows in every cubic three connected planar bipartite graph of n nodes is where n is the number of nodes.