On dispersable book embeddings
From MaRDI portal
Publication:5915585
DOI10.1007/978-3-030-00256-5_1zbMath1497.68363arXiv1803.10030OpenAlexW2963317554MaRDI QIDQ5915585
No author found.
Publication date: 22 November 2018
Published in: Theoretical Computer Science, Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.10030
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
A survey on book-embedding of planar graphs, Upward book embeddability of \(st\)-graphs: complexity and algorithms, On mixed linear layouts of series-parallel graphs, On Mixed Linear Layouts of Series-Parallel Graphs, On dispersability of some products of cycles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-page book embeddings of 4-planar graphs
- Distinct distances in graph drawings
- Embedding planar graphs in four pages
- The book thickness of a graph
- A left-first search algorithm for planar graphs
- Graph treewidth and geometric thickness parameters
- Graph drawings with few slopes
- Extension of a theorem of Whitney
- On edge but not vertex transitive regular graphs
- Bounded-degree graphs have arbitrarily large geometric thickness
- Bounded-degree graphs can have arbitrarily large slope numbers
- The Book Embedding Problem from a SAT-Solving Perspective
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Efficient Planarity Testing
- Graphs with E Edges Have Pagenumber O(√E)
- Genus g Graphs Have Pagenumber O(√g)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Halin graphs and the travelling salesman problem
- Regular line-symmetric graphs
- On uniquely colorable planar graphs
- Sorting Using Networks of Queues and Stacks
- A textbook of graph theory
