%I A054853
%S A054853 1,26,1858,236926,53456032,21493860332,15580415345706,
%T A054853 20666613177952152,50987341499153087708,237747594646361178843768,
%U A054853 2125708461695379843278043006,36886187376770375742178892122216
%N A054853 Number of labeled 3-edge-connected graphs by nodes.
%C A054853 The reference given here also contains the edge breakups foreach node 
               given here.
%D A054853 Sridar K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. 
               Thesis, University of Georgia, 2000. (Under the direction of Robert 
               W. Robinson, rwr(AT)cs.uga.edu)
%D A054853 Sridar K. Pootheri, Characterizing and counting classes of unlabeled 
               2-connected graphs, Ph.D. Dissertation, University of Georgia, 2000. 
               (Under the direction of Robert W. Robinson, rwr(AT)cs.uga.edu)
%Y A054853 Cf. A054316, A038207.
%Y A054853 Sequence in context: A123537 A054597 A005643 this_sequence A103642 A087616 
               A058449
%Y A054853 Adjacent sequences: A054850 A054851 A054852 this_sequence A054854 A054855 
               A054856
%K A054853 nice,nonn
%O A054853 4,2
%A A054853 Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000