Title of article
A planarity criterion for cubic bipartite graphs Original Research Article
Author/Authors
T. B?hme، نويسنده , , J. Harant، نويسنده , , A. Pruchnewski، نويسنده , , I. Schiermeyer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
13
From page
31
To page
43
Abstract
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.
Keywords
Planar , Bipartite , Graph , Cubic
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951175
Link To Document