login
Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the open-bowtie graph.
0

%I #20 May 12 2019 12:20:18

%S 1,1,2,6,11,33,94,370,1627,8895,56416,414456,3382661

%N Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the open-bowtie graph.

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535.

%Y Cf. A242791 (open-bowtie free graphs), A003094 (planar graphs).

%K nonn,more

%O 1,3

%A _Travis Hoppe_ and _Anna Petrone_, Jun 16 2014

%E a(11)-a(13) added using tinygraph by _Falk Hüffner_, May 12 2019