Four pages are indeed necessary for planar graphs
From MaRDI portal
Publication:5120157
DOI10.20382/JOCG.V11I1A12zbMath1486.05055arXiv2004.07630OpenAlexW3090082925MaRDI QIDQ5120157
Torsten Ueckerdt, Michael A. Bekos, Michael A. Kaufmann, Sergey Pupyrev, Fabian Klute, Chrysanthi N. Raftopoulou
Publication date: 9 September 2020
Full work available at URL: https://arxiv.org/abs/2004.07630
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (21)
Stack-number is not bounded by queue-number ⋮ On the queue number of planar graphs ⋮ The mixed page number of graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Graphs of linear growth have bounded treewidth ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ The Rique-number of graphs ⋮ An improved upper bound on the queue number of planar graphs ⋮ Linear layouts of bipartite planar graphs ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Lazy queue layouts of posets ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On mixed linear layouts of series-parallel graphs ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
This page was built for publication: Four pages are indeed necessary for planar graphs
