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
0, 1, 1, 3, 10, 54, 407, 4630, 68425, 1211637 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..10.

L. E. Danielsen, Database of Circle Graphs

L. E. Danielsen and M. G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, arXiv:0804.2576 [math.CO], 2008-2009.

L. E. Danielsen and M. G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, Discrete Appl. Math. 158(6), pp. 636-648, 2010.

EXAMPLE

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

CROSSREFS

Cf. A156809, A156808, A002218.

Sequence in context: A071895 A054422 A074503 * A301920 A229311 A208480

Adjacent sequences:  A318185 A318186 A318187 * A318189 A318190 A318191

KEYWORD

nonn,hard,more

AUTHOR

Fidel I. Schaposnik, Sep 01 2018

STATUS

approved

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 July 22 10:41 EDT 2019. Contains 325219 sequences. (Running on oeis4.)