Unlabeled level planarity

Consider a graph G with vertex set V in which each of the n vertices is assigned a number from the set {1,...,k} for some positive integer k. This assignment &phis; is a labeling if all k numbers are used. If &phis; does not assign adjacent vertices the same label, then &phis; partitions V into k levels. In a level drawing, the y-coordinate of each vertex matches its label and the edges are drawn strictly y-monotone. This leads to level drawings in the xy-plane where all vertices with label j lie along the line ℓj = {(x, j) : x ∈ R } and where each edge crosses any of the k horizontal lines ℓj for j ∈ [1.. k] at most once. A graph with such a labeling forms a level graph and is level planar if it has a level drawing without crossings.;We first consider the class of level trees that are level planar regardless of their labeling. We call such trees unlabeled level planar (ULP). We describe which trees are ULP and provide linear-time level planar drawing algorithms for any labeling. We characterize ULP trees in terms of two forbidden subdivisions so that any other tree must contain a subtree homeomorphic to one of these. We also provide linear-time recognition algorithms for ULP trees. We then extend this characterization to all ULP graphs with five additional forbidden subdivisions, and provide linear-time recognition and drawing algorithms for any given labeling.