8 citations · 8 across the 8 of their papers we have counts for
Showing 2026 · math.COShow all
2 papers · 2 filters
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
Asymptotics of the number of labelled connected sparse multitype graphs
Luisa Andreis, Mario Veshaj
We study the asymptotic enumeration of labelled connected multitype graphs in the sparse regime, where both the number of vertices and edges grow linearly and the excess is proport…