A156808
Number of nonisomorphic connected circle graphs of order n.
Original entry on oeis.org
1, 1, 2, 6, 21, 110, 789, 8336, 117283, 2026331, 40302425, 892278076
Offset: 1
Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009
- R. Arratia, B. Bollobas, D. Coppersmith, and G. B. Sorkin, Euler circuits and DNA sequencing by hybridization, Discrete Appl. Math., 104 (2000), 63-96.
- 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, Database of Circle Graphs.
A318188
Number of nonisomorphic 2-connected circle graphs of order n.
Original entry on oeis.org
0, 1, 1, 3, 10, 54, 407, 4630, 68425, 1211637
Offset: 1
The 3 circle graphs with n = 4 vertices which are 2-connected are K_4, the square and the square with one diagonal.
- 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.
Showing 1-2 of 2 results.