Luisa Andreis

A note on generating polyhedra and quadrangulations

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. I...