On the Page Number of Upward Planar Directed Acyclic Graphs

DOI10.7155/jgaa.00292zbMath1266.05165OpenAlexW2116216196MaRDI QIDQ4925307

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

zbMATH Keywords

\(n\)-vertex upward planar triangulation

Mathematics Subject Classification ID

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

Related Items (9)

A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ Lazy queue layouts of posets ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Upward Book Embeddings of st-Graphs ⋮ Lazy Queue Layouts of Posets

This page was built for publication: On the Page Number of Upward Planar Directed Acyclic Graphs