On Mixed Linear Layouts of Series-Parallel Graphs
From MaRDI portal
Cites work
- 1-page and 2-page drawings with bounded number of crossings per edge
- A left-first search algorithm for planar graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Embedding planar 5-graphs in three pages
- Embedding planar graphs in four pages
- Extension of a theorem of Whitney
- Four pages are indeed necessary for planar graphs
- Graph layouts via layered separators
- Halin graphs and the travelling salesman problem
- Hamiltonian circuits in simplicial complexes
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- Laying Out Graphs Using Queues
- Mixed linear layouts of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- On the Queue Number of Planar Graphs
- On the queue-number of graphs with bounded tree-width
- Planar graphs have bounded queue-number
- Planar graphs that need four pages
- Queue layouts of planar 3-trees
- Stack and queue number of 2-trees
- The book thickness of a graph
- Track layouts, layered path decompositions, and leveled planarity
- Triconnected planar graphs of maximum degree five are subhamiltonian
- Two-page book embeddings of 4-planar graphs
Cited in
(4)
This page was built for publication: On Mixed Linear Layouts of Series-Parallel Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014112)
