Abstract
We present the set of planar graphs that always have a simultaneous geometric embedding with a strictly monotone path on the same set of n vertices, for any of the n! possible mappings. These graphs are equivalent to the set of unlabeled level planar (ULP) graphs that are level planar over all possible labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for ULP graphs. Second, we provide a complete characterization of ULP graphs by showing that any other graph must contain a subgraph homeomorphic to one of seven forbidden graphs. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fowler, J. J., & Kobourov, S. G. (2008). Characterization of unlabeled level planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 37–49). https://doi.org/10.1007/978-3-540-77537-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
