Minimum level nonplanar patterns for trees

Authors:
J. Joseph Fowler;Stephen G. Kobourov
Affiliations:
Department of Computer Science, University of Arizona;Department of Computer Science, University of Arizona
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 1
Cited 5

Characterization of unlabeled level planar trees

GD'06 Proceedings of the 14th international conference on Graph drawing

Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Graph Simultaneous Embedding Tool, GraphSET

Graph Drawing
Characterization of unlabeled level planar trees

Computational Geometry: Theory and Applications
On a tree and a path with no geometric simultaneous embedding

GD'10 Proceedings of the 18th international conference on Graph drawing
On the characterization of level planar trees by minimal patterns

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimum level nonplanar (MLNP) patterns play the role for level planar graphs that the forbidden Kuratowksi subdivisions K5 and K3,3 play for planar graphs. We add two MLNP patterns for trees to the previous set of tree patterns given by Healy et al. Neither of these patterns match any of the previous patterns. We show that this new set of patterns completely characterizes level planar trees.