On the page number of upward planar directed acyclic graphs
From MaRDI portal
Publication:4925307
DOI10.7155/JGAA.00292zbMATH Open1266.05165OpenAlexW2116216196MaRDI QIDQ4925307FDOQ4925307
Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas
Publication date: 12 June 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00292
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (12)
- Upward Book Embeddings of st-Graphs
- On families of planar DAGs with constant stack number
- Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs
- Lazy queue layouts of posets
- On the upward book thickness problem: combinatorial and complexity results
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On the page number of triple-loop networks with even cardinality.
- Lazy Queue Layouts of Posets
- Recognizing DAGs with page-number 2 is NP-complete
- Recognizing DAGs with page-number 2 is NP-complete
- On the upward book thickness problem: combinatorial and complexity results
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 Q4925307)