A318188 Number of nonisomorphic 2-connected circle graphs of order n.
0, 1, 1, 3, 10, 54, 407, 4630, 68425, 1211637
Offset: 1
Examples
The 3 circle graphs with n = 4 vertices which are 2-connected are K_4, the square and the square with one diagonal.
Links
- 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.