TITLE: Enumeration of connected, bridgeless, trivalent graphs
QUESTION [2 upvotes]: Is it known how many connected, bridgeless, trivalent graphs there are on $2n$ vertices?
I am allowing the graph to have multiple edges, but no self edges (though I think the fact that the graph is trivalent and bridgeless rules out the possibility of self-edges). Here we say a graph is bridgeless if it does not contain any edges that would disconnect the graph if removed.
Edit: I have found a sequence for the number of connected, loopless, trivalent graphs on $2n$ vertices, which I believe is a super set of what I want (bridgeless $\Rightarrow$ loopless).

REPLY [2 votes]: This is about the generation problem, which is different from the theoretical enumeration problem.
One method, which is not efficient for large sizes is to use the tools geng  and multig from nauty:
geng -CD3 16 | multig -m2r3 -u
counts 23811 mutltigraphs on 16 vertices in about 10 seconds. First the 2-connected simple graphs with maximum degree 3 are made, then some edges are doubled to make it cubic. Change "-u" to "-T" if you want to see the multigraphs. It takes over an hour for 20 vertices (mostly in the first step) which is not so good.
A faster method is to make connected cubic multigraphs and reject those which are not 2-connected. An example of code to generate connected cubic multigraphs is here. The linear test for 2-connectivity is unfortunately not included but will add very little to the generation time.
The counts up to order 20 are 1, 2, 5, 16, 66, 365, 2602, 23811, 264993, 3449683.
{"set_name": "stack_exchange", "score": 2, "question_id": 376890}