15 citations · 32 across the 11 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
A note on generating polyhedra and quadrangulations
Luisa Andreis, Riccardo W. Maffucci, Federico Polito
A polyhedron is a planar, -connected graph. We iteratively construct all polyhedra (save for pyramids) from a unique starting graph, namely the square pyramid, via two graph tra…
math.CO2026
Counting connected multitype graphs with prescribed edge counts
Luisa Andreis, Mario Veshaj
We determine the exponential asymptotics of the number of connected labelled graphs with finitely many vertex types, prescribed numbers of vertices of each type, and prescribed edg…