Abstract
Minimum Level Nonplanar (MLNP) patterns play the role for level planar graphs that the forbidden Kuratowksi subdivisions K 5 and K 3,3 play for planar graphs. We add two (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [4]. Neither of these patterns match any of the previous patterns. We show that this new set of patterns completely characterizes level planar trees. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fowler, J. J., & Kobourov, S. G. (2008). Minimum level nonplanar patterns for trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 69–75). https://doi.org/10.1007/978-3-540-77537-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
