Generation of simple quadrangulations of the sphere

Abstract

A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3-connected, and 3-connected without non-facial 4-cycles. In each case, we show how the class can be generated by starting with some basic graphs in the class and applying a sequence of local modifications. The duals of our algorithms generate classes of quartic (4-regular) planar graphs. In the case of minimum degree 3, our result is a strengthening of a theorem of Nakamoto and almost implicit in Nakamoto's proof. In the case of 3-connectivity, a corollary of our theorem matches a theorem of Batagelj. However, Batagelj's proof contained a serious error which cannot easily be corrected. We also give a theoretical enumeration of rooted planar quadrangulations of minimum degree 3, and some counts obtained by a program of Brinkmann and McKay that implements our algorithm. Show more