Characterization of Level Non-planar Graphs by Minimal Patterns

Authors:
Patrick Healy;Ago Kuusik;Sebastian Leipert
Affiliations:
-;-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 2
Cited 0

Drawing graphs in two layers

Theoretical Computer Science
An Alternative Method to Crossing Minimization on Hierarchical Graphs

GD '96 Proceedings of the Symposium on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations. These characterizations are an important first step towards attacking the NP-hard level planarization problem.