Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs

Timothy R. S. Walsh. Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. Journal of Combinatorial Theory, Series A, 32(1):12-32, 1982. [doi]

Authors

Timothy R. S. Walsh

This author has not been identified. Look up 'Timothy R. S. Walsh' in Google