On enumeration of labeled connected bridgeless graphs

In this paper, we obtain explicit formulas and asymptotics for some classes of bridgeless labeled graphs: cacti, block graphs, block-cactus graphs, and series-parallel graphs. We prove that, under a uniform probability distribution, almost all graphs from the classes considered have bridges.