On the Page Number of Upward Planar Directed Acyclic Graphs
From MaRDI portal
Publication:3223971
DOI10.1007/978-3-642-25878-7_37zbMath1312.05036OpenAlexW2104785625MaRDI QIDQ3223971
Fabrizio Frati, Andres J. Ruiz-Vargas, Radoslav Fulek
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Embedding planar graphs in four pages
- Algorithms for plane representations of acyclic digraphs
- Covering and coloring polygon-circle graphs
- On the pagenumber of complete bipartite graphs
- Book embeddability of series-parallel digraphs
- Thickness and coarseness of graphs
- Coloring circle graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- The pagenumber of genus g graphs is O( g )
- Graphs with E Edges Have Pagenumber O(√E)
- Genus g Graphs Have Pagenumber O(√g)
- Stack and Queue Layouts of Posets
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Sorting Using Networks of Queues and Stacks
- The pagenumber of \(k\)-trees is \(O(k)\)
This page was built for publication: On the Page Number of Upward Planar Directed Acyclic Graphs