|
%I #8 Jan 18 2016 02:10:00
%S 0,0,0,1,1,5,15,68,343,2131,16020,150841
%N Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5 and are chordal and prime.
%C P5 = path on five vertices. G chordal iff every cycle of size 4 or more has a chord. G prime if it has no module (homogeneous set.)
%D A. Brandstadt, F. Dragan, H.O. Le, R. Mosca, "New Graph Classes of Bounded Clique-Width," manuscript, 2002.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version e8699da.
%K more,nonn
%O 1,6
%A _Jim Nastos_, Jan 24 2003
%E a(10)-a(12) added using tinygraph by _Falk Hüffner_, Jan 17 2016
|
