On the queue number of planar graphs
From MaRDI portal
Publication:2151450
DOI10.1007/978-3-030-92931-2_20OpenAlexW4205877847MaRDI QIDQ2151450
Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2106.08003
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
The mixed page number of graphs ⋮ The family of fan-planar graphs ⋮ The Rique-number of graphs ⋮ On mixed linear layouts of series-parallel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the queue-number of graphs with bounded tree-width
- Embedding planar graphs in four pages
- The book thickness of a graph
- On minimum cuts and the linear arrangement problem
- Track layouts, layered path decompositions, and leveled planarity
- Stack and Queue Layouts via Layered Separators
- Two-Page Book Embeddings of 4-Planar Graphs
- The bandwidth problem for graphs and matrices—a survey
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- On bandwidth, cutwidth, and quotient graphs
- Four pages are indeed necessary for planar graphs
- Planar Graphs Have Bounded Queue-Number
- Planar Graphs of Bounded Degree Have Bounded Queue Number
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- Queue layouts of planar 3-trees
This page was built for publication: On the queue number of planar graphs
