login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318188 Number of nonisomorphic 2-connected circle graphs of order n. 0

%I

%S 0,1,1,3,10,54,407,4630,68425,1211637

%N Number of nonisomorphic 2-connected circle graphs of order n.

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

%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 and M. G. Parker, <a href="https://doi.org/10.1016/j.dam.2009.11.011">Interlace polynomials: Enumeration, unimodality, and connections to codes</a>, Discrete Appl. Math. 158(6), pp. 636-648, 2010.

%e The 3 circle graphs with n = 4 vertices which are 2-connected are K_4, the square and the square with one diagonal.

%Y Cf. A156809, A156808, A002218.

%K nonn,hard,more

%O 1,4

%A _Fidel I. Schaposnik_, Sep 01 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 22:26 EDT 2019. Contains 328211 sequences. (Running on oeis4.)