The mixed page number of graphs
From MaRDI portal
Publication:2167907
Recommendations
Cites work
- scientific article; zbMATH DE number 5605062 (Why is no real title available?)
- scientific article; zbMATH DE number 3903967 (Why is no real title available?)
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- scientific article; zbMATH DE number 3997796 (Why is no real title available?)
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Embedding planar graphs in four pages
- Four pages are indeed necessary for planar graphs
- Graph minors. I. Excluding a forest
- Graphs with E Edges Have Pagenumber O(√E)
- Laying Out Graphs Using Queues
- Mixed linear layouts of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- On Mixed Linear Layouts of Series-Parallel Graphs
- On the pagenumber of complete bipartite graphs
- On the queue number of planar graphs
- On the queue-number of graphs with bounded tree-width
- Optimal Linear Ordering
- Planar graphs have bounded queue-number
- Planar graphs of bounded degree have bounded queue number
- Queue layouts of planar 3-trees
- Stacks, queues and tracks: layouts of graph subdivisions
- The bandwidth problem for graphs and matrices—a survey
- The book embedding problem from a SAT-solving perspective
- The book thickness of a graph
- The pagenumber of \(k\)-trees is \(O(k)\)
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)