A338584
Number of unlabeled nonplanar connected graphs with n edges with minimum degree 3 at each node that are not 3-connected.
Original entry on oeis.org
1, 6, 28, 128, 558, 2421, 10675, 47810, 217572, 1006211
Offset: 13
A199676
Number of minimally 3-connected non-isomorphic graphs on n vertices.
Original entry on oeis.org
1, 1, 3, 5, 18, 57, 285, 1513, 9824, 69536, 540622, 4494676
Offset: 4
- 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.
A361370
Number of weakly 3-connected simple digraphs with n unlabeled nodes.
Original entry on oeis.org
42, 3270, 879508
Offset: 4
- M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation.
A366224
Number of unlabeled 3-connected graphs on n vertices with girth at least 5.
Original entry on oeis.org
1, 0, 2, 4, 23, 149, 1670, 23882, 422194, 8544496, 195291551
Offset: 10
The smallest such graph is the Petersen graph on 10 vertices.
A366225 (3-connected graphs with girth at least 6).
A359704
Minimum number of spanning trees in a 3-connected graph on n nodes.
Original entry on oeis.org
16, 45, 75, 209, 336, 928, 1445, 3965, 6000, 16555
Offset: 4
a(4) = 16 which is the number of spanning trees in the complete graph on 4 nodes.
Cf.
A006290 (3-connected graphs),
A199676 (minimally 3-connected graphs).
Comments