A156809 - OEIS

%I #11 Oct 17 2020 10:52:04

%S 1,2,4,11,34,154,978,9497,127954,2165291,42609994,937233306,

%T 22576188846

%N Number of nonisomorphic circle graphs of order n

%H R. Arratia, B. Bollobas, D. Coppersmith, and G. B. Sorkin, <a href="https://doi.org/10.1016/S0166-218X(00)00190-6">Euler circuits and DNA sequencing by hybridization</a>, Discrete Appl. Math., 104 (2000), 63-96.

%H Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev, <a href="https://arxiv.org/abs/1803.01055">On k-11-representable graphs</a>, arXiv:1803.01055 [math.CO], 2018.

%H L. E. Danielsen and M. G. Parker, <a href="https://arxiv.org/abs/0804.2576">Interlace polynomials: Enumeration, unimodality, and connections to codes</a>, arXiv:0804.2576 [math.CO], 2008-2009.

%H L. E. Danielsen, <a href="http://www.ii.uib.no/~larsed/circle/">Database of Circle Graphs</a>.

%Y Cf. A156808.

%K hard,nonn

%O 1,2

%A Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009

%E a(13) from _Tom Johnston_, Oct 17 2020