On the page number of upward planar directed acyclic graphs

DOI10.7155/JGAA.00292MaRDI QIDQ4925307zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00292

zbMATH Keywords

\(n\)-vertex upward planar triangulation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the page number of upward planar directed acyclic graphs
• scientific article; zbMATH DE number 431511
• scientific article; zbMATH DE number 432821
• Ordered sets, pagenumbers and planarity
• On the number of upward planar orientations of maximal planar graphs

Cited in

(18)

• On the page number of upward planar directed acyclic graphs
• Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
• On families of planar DAGs with constant stack number
• Lazy queue layouts of posets
• On the upward book thickness problem: combinatorial and complexity results
• On the number of upward planar orientations of maximal planar graphs
• A Sublinear Bound on the Page Number of Upward Planar Graphs
• Upward book embeddings of st-graphs
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• N-free planar ordered sets that contain no covering four-cycle have pagenumber two
• On the page number of triple-loop networks with even cardinality.
• Directed acyclic outerplanar graphs have constant stack number
• The price of upwardness
• Lazy Queue Layouts of Posets
• Recognizing DAGs with page-number 2 is NP-complete
• Recognizing DAGs with page-number 2 is NP-complete
• The price of upwardness
• 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)