A note on generating polyhedra and quadrangulations

Source abstract

A polyhedron is a planar, $3$-connected graph. We iteratively construct all polyhedra (save for pyramids) from a unique starting graph, namely the square pyramid, via two graph transformations. This builds upon a previous construction, that starts from the full class of pyramids, and applies the same transformations. In a related result, we iteratively construct all quadrangulations of the sphere where all $4$-cycles are facial, i.e., the class of radial graphs of the polyhedra (save for antibipyramids), from a unique starting graph, namely the square antibipyramid, via a unique graph transformation. This builds upon a previous construction, that starts from the full class of antibipyramids, and applies the same transformation.