Polychromatic 4-coloring of cubic bipartite plane graphs

It is proved that the vertices of a cubic bipartite plane graph can be colored with four colors such that each face meets all four colors. This is tight, since any such graph contains at least six faces of size four.