|
|
A298361
|
|
a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout.
|
|
0
|
|
|
1, 1, 1, 2, 5, 14, 50, 233, 1249, 7595, 49566, 339712, 2405167, 17412878, 127855172, 947394711
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,4
|
|
COMMENTS
|
Computed by an exhaustive search.
|
|
REFERENCES
|
S. Pupyrev, Mixed Linear Layouts of Planar Graphs, International Symposium on Graph Drawing and Network Visualization (GD 2017).
|
|
LINKS
|
Gunnar Brinkmann and Brendan McKay, Plantri and fullgen, programs for generation of certain types of planar graph.
|
|
EXAMPLE
|
For n <= 13, all maximal simple planar graphs admit a 2-queue layout; hence, the values are the same as in A000109.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|