Local and union page numbers
From MaRDI portal
Publication:2206876
DOI10.1007/978-3-030-35802-0_34OpenAlexW2991188933MaRDI QIDQ2206876
Laura Merker, Torsten Ueckerdt
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1907.09994
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Linear layouts of complete graphs, On mixed linear layouts of series-parallel graphs, The Local Queue Number of Graphs with Bounded Treewidth
Cites Work
- Unnamed Item
- Unnamed Item
- Three ways to cover a graph
- Embedding planar graphs in four pages
- The book thickness of a graph
- Star arboricity
- On the pagenumber of complete bipartite graphs
- 1-page and 2-page drawings with bounded number of crossings per edge
- Boolean dimension and local dimension
- Local and union boxicity
- Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs
- Star arboricity of graphs
- Graph treewidth and geometric thickness parameters
- On the Pagenumber of k-Trees
- The Complexity of Coloring Circular Arcs and Chords
- The pagenumber of genus g graphs is O( g )
- Graphs with E Edges Have Pagenumber O(√E)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Decomposition of Finite Graphs Into Forests
- The pagenumber of \(k\)-trees is \(O(k)\)
- Stack and queue number of 2-trees
