On the page number of upward planar directed acyclic graphs
DOI10.1007/978-3-642-25878-7_37zbMATH Open1312.05036OpenAlexW2104785625MaRDI QIDQ3223971FDOQ3223971
Authors: Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas
Publication date: 9 March 2012
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_37
Recommendations
Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Embedding planar graphs in four pages
- On the pagenumber of complete bipartite graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Sorting Using Networks of Queues and Stacks
- Algorithms for plane representations of acyclic digraphs
- Covering and coloring polygon-circle graphs
- Graphs with E Edges Have Pagenumber O(√E)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Genus g Graphs Have Pagenumber O(√g)
- Stack and Queue Layouts of Posets
- The pagenumber of \(k\)-trees is \(O(k)\)
- Thickness and coarseness of graphs
- Coloring circle graphs
- Book embeddability of series-parallel digraphs
- The pagenumber of genus g graphs is O( g )
Cited In (7)
- On the page number of upward planar directed acyclic graphs
- Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- The pagenumber of toroidal graphs is at most seven
- On the page number of triple-loop networks with even cardinality.
- Upward partitioned book embeddings
- Recognizing DAGs with page-number 2 is NP-complete
This page was built for publication: On the page number of upward planar directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223971)