login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.
S. Pupyrev, Mixed Linear Layouts of Planar Graphs, arXiv:1709.00285 [cs.CG], 2017-2018.
Wikipedia, Queue number.
EXAMPLE
For n <= 13, all maximal simple planar graphs admit a 2-queue layout; hence, the values are the same as in A000109.
CROSSREFS
Cf. A000109.
Sequence in context: A339832 A245883 A115340 * A000109 A049338 A306892
KEYWORD
nonn,more
AUTHOR
Sergey Pupyrev, Jan 17 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)