On families of planar DAGs with constant stack number
From MaRDI portal
Publication:6560144
DOI10.1007/978-3-031-49272-3_10MaRDI QIDQ6560144
Martin Nöllenburg, Sergey Pupyrev
Publication date: 21 June 2024
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered sets, pagenumbers and planarity
- Embedding planar graphs in four pages
- Covering and coloring polygon-circle graphs
- A triangle-free circle graph with chromatic number 5
- On mixed linear layouts of series-parallel graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- Book embeddability of series-parallel digraphs
- Recognizing DAGs with page-number 2 is NP-complete
- Lazy queue layouts of posets
- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Stack and Queue Layouts of Posets
- Mixed Linear Layouts of Planar Graphs
- On the Page Number of Upward Planar Directed Acyclic Graphs
- Improved bounds for colouring circle graphs
- Upward Book Embeddings of st-Graphs
- Improved Bounds for Track Numbers of Planar Graphs
- Four pages are indeed necessary for planar graphs
- Planar Graphs Have Bounded Queue-Number
- Queue layouts of planar 3-trees
- On the upward book thickness problem: combinatorial and complexity results
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Queue layouts of two-dimensional posets
This page was built for publication: On families of planar DAGs with constant stack number
