A078564 Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to the complement of P5 (the "house" graph).

1, 1, 2, 6, 20, 93, 515, 3701, 32714, 359289, 4847830, 80064871, 1607606989, 38983675574

Offset: 1

Author

Jim Nastos, Jan 07 2003

Keywords

• more
• nonn

Comments

Also, number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a P5 (the path on 5 vertices). - Falk Hüffner, Nov 27 2015

Links

• Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong, Obstructions for three-coloring graphs without induced paths on six vertices, arXiv preprint arXiv:1504.06979 [math.CO], 2015.
• F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8489dde.

Extensions

Corrected by Jim Nastos, Jan 20 2003

a(10)-a(14) from Falk Hüffner, Jan 13 2016