Sergey Pupyrev - cp's OEIS frontend

User: Sergey Pupyrev

Sergey Pupyrev has authored 2 sequences.

1, 1, 2, 4, 7, 17, 36, 94, 237, 658, 1845, 5527, 16809, 53357, 173298, 580331, 1988935, 6991328, 25124511, 92325353, 346401296, 1326493369

Offset: 1

Sergey Pupyrev, May 29 2025

			a(3) = 2 since there are two connected bipartite graphs with three edges: a path and a star "Y".

for (( i=$(bc <<< "sqrt(4*${n})"); i<=$((n+1)); i++ )) do ~/nauty2_8_9/geng -c -b ${i}:${i} ${n} -u; done

a(19)-a(22) from Sean A. Irvine, Jun 09 2025

1, 1, 1, 2, 5, 14, 50, 233, 1249, 7595, 49566, 339712, 2405167, 17412878, 127855172, 947394711

Offset: 3

Sergey Pupyrev, Jan 17 2018

Computed by an exhaustive search.

			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).

Gunnar Brinkmann and Brendan McKay, Plantri and fullgen, programs for generation of certain types of planar graph.
S. Pupyrev, Mixed Linear Layouts of Planar Graphs, arXiv:1709.00285 [cs.CG], 2017-2018.
Wikipedia, Queue number.