The mixed page number of graphs
From MaRDI portal
Publication:2167907
DOI10.1016/j.tcs.2022.07.036OpenAlexW3177852403MaRDI QIDQ2167907
Publication date: 1 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.04993
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the queue-number of graphs with bounded tree-width
- Graph minors. I. Excluding a forest
- Embedding planar graphs in four pages
- The book thickness of a graph
- On the pagenumber of complete bipartite graphs
- On the queue number of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- The Book Embedding Problem from a SAT-Solving Perspective
- The bandwidth problem for graphs and matrices—a survey
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Graphs with E Edges Have Pagenumber O(√E)
- Mixed Linear Layouts of Planar Graphs
- On Mixed Linear Layouts of Series-Parallel Graphs
- Four pages are indeed necessary for planar graphs
- Planar Graphs Have Bounded Queue-Number
- Optimal Linear Ordering
- Planar Graphs of Bounded Degree Have Bounded Queue Number
- Queue layouts of planar 3-trees
- The pagenumber of \(k\)-trees is \(O(k)\)
This page was built for publication: The mixed page number of graphs
