OFFSET
1,4
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.
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
KEYWORD
nonn,hard,more
AUTHOR
Fidel I. Schaposnik, Sep 01 2018
STATUS
approved