The mixed page number of graphs
From MaRDI portal
Publication:2167907
DOI10.1016/J.TCS.2022.07.036OpenAlexW3177852403MaRDI QIDQ2167907FDOQ2167907
Authors: Yanyan Li 
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
Recommendations
Cites Work
- The book thickness of a graph
- Laying Out Graphs Using Queues
- Graph minors. I. Excluding a forest
- Embedding planar graphs in four pages
- On the pagenumber of complete bipartite graphs
- Title not available (Why is that?)
- Optimal Linear Ordering
- The bandwidth problem for graphs and matrices—a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with E Edges Have Pagenumber O(√E)
- Title not available (Why is that?)
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stacks, queues and tracks: layouts of graph subdivisions
- On the queue-number of graphs with bounded tree-width
- The pagenumber of \(k\)-trees is \(O(k)\)
- Mixed linear layouts of planar graphs
- On the queue number of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- Planar graphs have bounded queue-number
- Four pages are indeed necessary for planar graphs
- Queue layouts of planar 3-trees
- The book embedding problem from a SAT-solving perspective
- Planar graphs of bounded degree have bounded queue number
- On Mixed Linear Layouts of Series-Parallel Graphs
Cited In (4)
This page was built for publication: The mixed page number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167907)
