|
%I #33 Jan 12 2021 06:23:02
%S 1,1,3,5,18,57,285,1513,9824,69536,540622,4494676
%N Number of minimally 3-connected non-isomorphic graphs on n vertices.
%H J. P. Costalonga, R. J. Kingan, and S. R. Kingan, <a href="https://arxiv.org/abs/2012.12059">Constructing minimally 3-connected graphs</a>, arXiv:2012.12059 [math.CO], 2020-2021; Algorithms 14, no. 1: 9.
%H Jens M. Schmidt, <a href="https://www3.tuhh.de/e11/schmidt/CombinatorialData/GraphData.html">Combinatorial data</a>.
%H David Kofoed Wind, <a href="/A006290/a006290.pdf">Connected Graphs with Fewest Spanning Trees</a>, Bachelor Thesis, Spring 2011.
%Y Cf. A006290, A204198, A324418, A338511.
%K nonn,hard,more
%O 4,3
%A _N. J. A. Sloane_, Nov 09 2011
%E a(12) given by _Jens M. Schmidt_, Feb 27 2019
%E a(13)-a(15) from _Jens M. Schmidt_'s web page, Jan 10 2021
|
