|
%I #15 May 03 2023 09:13:12
%S 1,26,1858,236926,53456032,21493860332,15580415345706,
%T 20666613177952152,50987341499153087708,237747594646361178843768,
%U 2125708461695379843278043006,36886187376770375742178892122216
%N Number of labeled 3-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. A054316, A038207, A257947.
%K nice,nonn
%O 4,2
%A Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
