A308588 Number of 4-regular 3-connected planar graphs with n vertices having an Eulerian tour for which no two consecutive edges are incident with the same face.

1, 1, 1, 1, 3, 5, 17, 40, 145, 355, 1264, 3931, 12999, 44727

Offset: 8

Author

Jan Kristian Haugland, Jun 09 2019

Keywords

• nonn
• more

Comments

Polyhedra formed by knot diagrams.

Links

• Stuart E Anderson, Illustrations of a(8) to a(14) 4-regular 3-connected planar graphs with n vertices having an Eulerian tour for which no two consecutive edges are incident with the same face.

Crossrefs

Cf. A007022.