On families of planar DAGs with constant stack number
From MaRDI portal
Publication:6560144
DOI10.1007/978-3-031-49272-3_10MaRDI QIDQ6560144FDOQ6560144
Authors: 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- A triangle-free circle graph with chromatic number 5
- Book embeddability of series-parallel digraphs
- Covering and coloring polygon-circle graphs
- Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
- Embedding planar graphs in four pages
- Four pages are indeed necessary for planar graphs
- Improved bounds for colouring circle graphs
- Improved bounds for track numbers of planar graphs
- Lazy queue layouts of posets
- Mixed linear layouts of planar graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- On mixed linear layouts of series-parallel graphs
- On the book embedding of ordered sets.
- On the page number of upward planar directed acyclic graphs
- On the upward book thickness problem: combinatorial and complexity results
- Ordered sets, pagenumbers and planarity
- Planar graphs have bounded queue-number
- Queue layouts of planar 3-trees
- Queue layouts of two-dimensional posets
- Recognizing DAGs with page-number 2 is NP-complete
- 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
- Upward book embeddings of st-graphs
This page was built for publication: On families of planar DAGs with constant stack number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560144)
