|
%I #13 Jan 17 2018 11:38:28
%S 0,0,0,0,0,0,1,1,3,5,11,20
%N Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.
%D G.-B. Chae (chaegabb(AT)pilot.msu.edu), E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, preprint, 2001.
%H G.-B. Chae, <a href="http://myhome.hanafos.com/~1234chae/myindex.htm">Home page</a>
%H G.-B. Chae, <a href="https://doi.org/10.1016/j.disc.2007.09.034">Counting labeled claw-free cubic graphs by connectivity</a>, Discrete Mathematics 308 (2008) 5136-5143.
%H G.-B. Chae, E. M. Palmer and R. W. Robinson, <a href="/A058929/a058929.pdf">Computing the number of Claw-free Cubic Graphs with given Connectivity</a>, Preprint, 2000. (Annotated scanned copy)
%K nonn,more
%O 1,9
%A _N. J. A. Sloane_, Jan 12 2001
|
