|
%I #16 Mar 30 2012 16:52:08
%S 0,0,1,2,10,53,376,3379,37408,485680,7150241,116726073,2085446355
%N Number of trivalent connected (or cubic) graphs with 2n nodes that are not planar.
%H F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, <a href="http://alexandria.tue.nl/repository/books/252909.pdf">Computer investigations of cubic graphs</a>, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.
%Y Equals A002851 - A005964.
%K nonn,more
%O 1,4
%A _N. J. A. Sloane_, Jan 12 2012
|
