A204198 Number of (strictly) 3-connected cubic graphs on 2n nodes.
0, 1, 2, 4, 14, 57, 341, 2828, 30468, 396150, 5909292, 98101019, 1782392646, 35085504243
Offset: 1
Links
- G. Brinkmann, J. Goedgebeur and B. D. McKay, snarkhunter.
- F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.
- J. P. Costalonga, R. J. Kingan, and S. R. Kingan, Constructing minimally 3-connected graphs, arXiv:2012.12059 [math.CO], 2020-2021; Algorithms 14, no. 1: 9.
Extensions
a(8)-a(10) from S. R. Kingan, Jan 08 2021
a(11)-a(14) from Ed Wynn, Jul 22 2023