Timothy R. S. Walsh. Counting labelled three-connected and homeomorphically irreducible two-connected graphs. Journal of Combinatorial Theory, Series A, 32(1):1-11, 1982. [doi]
@article{Walsh82, title = {Counting labelled three-connected and homeomorphically irreducible two-connected graphs}, author = {Timothy R. S. Walsh}, year = {1982}, doi = {10.1016/0095-8956(82)90072-7}, url = {http://dx.doi.org/10.1016/0095-8956(82)90072-7}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Walsh82}, cites = {0}, citedby = {0}, journal = {Journal of Combinatorial Theory, Series A}, volume = {32}, number = {1}, pages = {1-11}, }