Graph classes with given 3-connected components: asymptotic enumeration and random graphs (2009)
Gimenez, Omer, Noy, Marc, Rue, Juanjo
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general...