Abstract
We consider the problem of determining the maximum and the minimum number of upward planar orientations a maximal planar graph can have. We show that n-vertex maximal planar graphs have at least Ω(n · 1.189 n) and at most O(n · 4n) upward planar orientations. Moreover, there exist n-vertex maximal planar graphs having as few as O(n · 2n) upward planar orientations and n-vertex maximal planar graphs having Ω(2.599n) upward planar orientations. © Springer-Verlag 2012.
Cite
CITATION STYLE
Frati, F., Gudmundsson, J., & Welzl, E. (2012). On the number of upward planar orientations of maximal planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 413–422). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
