Quadrilateral embeddings of bipartite graphs
Ian Muir Anderson · Journal of Graph Theory · 1981
Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of Kn and Kn, n into graphs with quadrilateral embeddings are discussed, and some thickness results are obtained. Some new genus results are also obtained.