login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079576
Number of unlabeled, connected graphs on n vertices that have no induced subgraph isomorphic to a gem, where a gem is a 4-path with a fifth vertex adjacent to all four of the vertices in the path.
0
1, 1, 2, 6, 20, 93, 534, 4291, 47120, 739310, 16641941, 539386425
OFFSET
1,3
REFERENCES
A. Brandstadt and D. Kratsch, "On (P5,Gem)-free and (P5,Gem,co-Gem)-free Graphs: Structure and algorithmic applications," Manuscript 2000.
LINKS
Qingqiong Cai, Jan Goedgebeur, and Shenwei Huang, Some Results on k-Critical P_5-Free Graphs, arXiv:2108.05492 [math.CO], 2021.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version e8699da.
CROSSREFS
Sequence in context: A210690 A079575 A078564 * A079570 A131842 A348104
KEYWORD
more,nonn
AUTHOR
Jim Nastos, Jan 24 2003
EXTENSIONS
a(10)-a(12) added using tinygraph by Falk Hüffner, Jan 17 2016
STATUS
approved