A216117
Decimal expansion of constant arising in enumeration of pseudo-triangulations.
Original entry on oeis.org
1, 6, 9, 4, 2, 8, 3, 8, 7
Offset: 1
A298361
a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout.
Original entry on oeis.org
1, 1, 1, 2, 5, 14, 50, 233, 1249, 7595, 49566, 339712, 2405167, 17412878, 127855172, 947394711
Offset: 3
For n <= 13, all maximal simple planar graphs admit a 2-queue layout; hence, the values are the same as in A000109.
- S. Pupyrev, Mixed Linear Layouts of Planar Graphs, International Symposium on Graph Drawing and Network Visualization (GD 2017).
A357822
Number of simplicial 3-spheres (triangulations of S^3) with n vertices.
Original entry on oeis.org
1, 2, 5, 39, 1296, 247882, 166564303
Offset: 5
A358287
Number of 3-connected planar cubic graphs with 2*n nodes and exactly one edge-Kempe equivalence class.
Original entry on oeis.org
1, 1, 1, 1, 13, 47, 210, 1096, 6373, 39860, 260293, 1753836
Offset: 2
A358288
Number of 3-connected planer cubic graphs with 2*n nodes and the maximum number of edge-Kempe equivalence classes.
Original entry on oeis.org
1, 1, 1, 1, 1, 3, 23, 1, 1, 1, 6, 31, 1, 2, 55, 1, 1, 1
Offset: 2
Comments