|
%I #10 Nov 25 2020 09:07:32
%S 1,3,22,255,3321,52948,1064988,25071525,667694395,20114706546,
%T 678833013618,25302305856919,1033146095157645,45956558123679960,
%U 2213869047416018296,114892917344393371209,6396625360877830999983
%N Number of labeled 2-connected 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, A054596.
%K nice,nonn
%O 3,2
%A Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
