4 cycles in a cubic planar bipartite graph I am trying to get (upper and lower) bounds on the number of 4-cycles($K_{2,2}$) in planar 3-regular bipartite graphs. The best I have been able to get is a bound based on the Euler characteristic. I know the upper bounds should be better than for general bipartite graphs due to the utility graph being a forbidden minor. The planarity and 3-regularity seem to also impose a lower bound.
For a graph as above with $2n$ vertices and $3n$ edges, I have gotten so far that there must be at least $\frac{n}{2}+4$ square faces in the graph by using the Euler characteristic. Are there such graphs where the faces are the only 4-cycles? It seems like a better bound should be possible. 
Also I have come up with a construction for a planar bipartite graph (not cubic) that has at least $4n+2$ four-cycles. But since it isn't cubic, and I am not sure if it is tight anyway, I don't see how it helps me.
If there are known results, those would be welcome, but I would really like to learn how to prove the bounds for this on my own. With that in mind even hints are acceptable.
EDIT
Okay, I think there are some fishy numbers in the comments, so I am going to show my work. We are assuming connected graphs.
Three regular graphs have an even number of vertices, and every bipartite cubic graph has a Tait coloring of the edges. This implies for a graph on $2n$ vertices, there are precisely $n$ in each side of the bipartition. By the handshaking lemma, there are $3n$ edges. Thus, Euler's characteristic implies that there are precisely $n+2$ faces, none of which are triangles. This should imply based on dtldarek's comment, that there are at most $n+2$ 4-cycles. But that can't be true (that for triangle free planar graphs all 4-cycles are faces), because of the following bipartite planar graph:

It has 4 faces, but 5 distinct four-cycles.
I will post my lower bound derivation when I get a chance.
 A: Let's look at bicubic planar graphs. As you say, there must be $2n$ vertices, $3n$ edges, and $n+2$ faces for some $n$. Suppose there are $F_j$ faces of length $j$; then we want lower and upper bounds on $F_4$ in terms of $n$.
Note that every 4-cycle in the graph must be a face in the planar embedding, because any chord in the 4-cycle would give you cycles of length 3, impossible in a bipartite graph. The graph you have at the end of the question is not a counterexample because it is not cubic (in a 3-regular graph, there would be two triangles on the bottom.)
Upper bound
The upper bound is $n+2$. This is obviously the maximum possible because it is the total number of faces, and it is achieved by the cube graph, where $n = 4$.

This is the only graph that achieves the bound, because it is the only cubic planar graph consisting only of squares. If all the faces are squares, then 4 times the number of faces must be 3 times the number of vertices, or
$$ 4(n+2) = 6n $$
so $n = 4$.
If we exclude this single graph, then the upper bound is $n$, and graphs with $F_4 = n$ can be found for arbitrarily large $n$ (see the prism graph at the end of this answer.)
To prove this, we need to show that we cannot have $n + 1$ 4-sided faces and a single $j$-sided face, with $j > 4$.
In this case
$$
6n = 4F_4 + jF_j = 4(n+1) + j
$$
so $j = 2n - 4$. The same logic as this answer by Henning Makholm applies:

Now start by drawing the face with $2n - 4$ sides. That uses up $2n -4$ nodes. Since the graph is cubic, each of these nodes have an extra neighbor. But if those neighbors are all different, then there would be at least $4n - 8$ nodes in the graph which is too many.
Therefore, there must be a pair of corners of the $j$-gon that share a neighbor outside the $j$-gon. Since [all other faces are 4-cycles], this is only possible if these two nodes are separated by one corner in the $j$-gon. But then it's impossible for the extra leg of the corner between them to connect to anything, which is absurd. So the graph cannot exist.

(It's not that absurd to have an edge going to another graph component 
contained within a face, but such an edge would be a cut-edge, which cannot exist in a regular bipartite graph.)
Lower bound
The lower bound is an arbitrarily small multiple of $n$. We can see this by applying a bitruncation operation, which replaces every vertex by a hexagon and leaves a smaller version of each face (with the same number of sides). Thus, starting from the cube, we get a bitruncated cube (aka truncated octahedron) with 6 squares and 8 hexagons ($n = 12$).

Bitruncating that gives a polyhedron with 6 squares and 32 hexagons ($n = 36$).

Bitruncating that gives a polyhedron with 6 squares and 104 hexagons ($n = 108$).

Here are the corresponding planar graphs:



In general, bitruncating yields a graph with 3 times as many vertices and the same number of squares, so we can keep going and get $F_4$ to be less than $\epsilon n$ for any $\epsilon > 0$.
Another option would be a chamfering operation, which replaces every edge by a hexagon and every face by a smaller face of the same number of sides. Starting from the cube, this gives you 4 times as many vertices with each step, so $n$ grows even faster, while always keeping 6 squares.
Absolute bounds
As you mention, any 3-regular planar bipartite graph must have at least 6 squares (assuming you forbid digons, that is, two edges between the same vertices). One way to show this is that 3 times the number of vertices equals the sum of each face's length, so
$$\begin{align}
6n &= 4F_4 + 6F_6 + 8F_8 + \ldots \\
&\geq 4F_4 + 6(n+2-F_4) \\
&= 6n + 12 - 2F_4 \\
2F_4 &\geq 12 \\
F_4 &\geq 6.
\end{align}$$
(If you allow digons, you can get this guy with two squares: )
There is no absolute upper bound on $F_4$ (independent of $n$), since you can have prism graphs with arbitrarily many squares:

These all have $F_4 = n$ and are bipartite for any even $n$.
