On mixed linear layouts of series-parallel graphs
From MaRDI portal
Publication:2087464
DOI10.1016/J.TCS.2022.09.019OpenAlexW4296520321MaRDI QIDQ2087464FDOQ2087464
Authors: Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze 
Publication date: 21 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.019
Cites Work
- Halin graphs and the travelling salesman problem
- The book thickness of a graph
- Laying Out Graphs Using Queues
- On the Queue Number of Planar Graphs
- Embedding planar graphs in four pages
- Extension of a theorem of Whitney
- Two-page book embeddings of 4-planar graphs
- Title not available (Why is that?)
- A left-first search algorithm for planar graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Graph layouts via layered separators
- On the queue-number of graphs with bounded tree-width
- Hamiltonian circuits in simplicial complexes
- Stack and queue layouts via layered separators
- Mixed linear layouts of planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 1-page and 2-page drawings with bounded number of crossings per edge
- On the queue number of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- Planar graphs have bounded queue-number
- Embedding planar 5-graphs in three pages
- Planar graphs that need four pages
- Local and union page numbers
- The Local Queue Number of Graphs with Bounded Treewidth
- Four pages are indeed necessary for planar graphs
- On dispersable book embeddings
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
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 Q2087464)
