A note on generating polyhedra and quadrangulations

Luisa Andreis, Riccardo W. Maffucci, Federico Polito

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 tra…