A054853 Number of labeled 3-edge-connected graphs by nodes.

1, 26, 1858, 236926, 53456032, 21493860332, 15580415345706, 20666613177952152, 50987341499153087708, 237747594646361178843768, 2125708461695379843278043006, 36886187376770375742178892122216

Offset: 4

Author

Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000

Keywords

• nice
• nonn

Comments

The reference given here also contains the edge breakups for each node given here.

Links

• S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Dissertation, University of Georgia, 2000.
• S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Thesis, University of Georgia, 2000. [Local copy]
• S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000.
• S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]

Crossrefs

Cf. A054316, A038207, A257947.