|
%I #9 May 03 2023 09:13:17
%S 1,3,37,435,6996,134428,3094785,82061325,2473950880,83606473566,
%T 3132506471139,128918727009163,5784184164416490,281105943314654760,
%U 14716271275161095761,825944690635111256697,49490362937885427672552
%N Number of labeled minimally 2-edge-connected graphs by nodes.
%C The reference given here also contains the edge breakups for each node given here.
%H S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20082">Counting classes of labeled 2-connected graphs</a>, M.S. Dissertation, University of Georgia, 2000.
%H S. K. Pootheri, <a href="/A054595/a054595.pdf">Counting classes of labeled 2-connected graphs</a>, M.S. Thesis, University of Georgia, 2000. [Local copy]
%H S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20083">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000.
%H S. K. Pootheri, <a href="/A003317/a003317_1.pdf">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]
%Y Cf. A054317, A001072, A054595.
%K nice,nonn
%O 3,2
%A Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
