

A079569


Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a P5 and are chordal and prime.


0



0, 0, 0, 1, 1, 5, 15, 68, 343, 2131, 16020, 150841
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,6


COMMENTS

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.)


REFERENCES

A. Brandstadt, F. Dragan, H.O. Le, R. Mosca, "New Graph Classes of Bounded CliqueWidth," manuscript, 2002.


LINKS

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version e8699da.


CROSSREFS



KEYWORD

more,nonn


AUTHOR



EXTENSIONS

a(10)a(12) added using tinygraph by Falk Hüffner, Jan 17 2016


STATUS

approved



