On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al.  characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns. Fowler and Kobourov  later proved that the set of patterns was incomplete and added two additional patterns. In this paper, we show that the characterization is still incomplete by providing new MLNP patterns not included in the previous characterizations. Moreover, we introduce an iterative method to create an arbitrary number of MLNP patterns, thus proving that the set of minimal patterns that characterizes level planar trees is infinite.
- 5.Estrella-Balderrama, A.: Simultaneous Embedding and Level Planarity. PhD thesis, Department of Computer Science, University of Arizona (2009)Google Scholar