login
A199676
Number of minimally 3-connected non-isomorphic graphs on n vertices.
1
1, 1, 3, 5, 18, 57, 285, 1513, 9824, 69536, 540622, 4494676
OFFSET
4,3
LINKS
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.
Jens M. Schmidt, Combinatorial data.
David Kofoed Wind, Connected Graphs with Fewest Spanning Trees, Bachelor Thesis, Spring 2011.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
N. J. A. Sloane, Nov 09 2011
EXTENSIONS
a(12) given by Jens M. Schmidt, Feb 27 2019
a(13)-a(15) from Jens M. Schmidt's web page, Jan 10 2021
STATUS
approved