A planarity criterion for cubic bipartite graphs Original Research Article

We prove that a simple finite bipartite cubic non-planar graph contains a clean subdivision of K3,3. Here a subdivision of K3,3 is defined to be clean if it can be obtained from K3,3 by subdividing any edge by an even number of vertices. The proof is constructive and gives rise to a polynomial-time algorithm.