P. Healy, A. Kuusik, S. Leipert
Published in:
Discrete Mathematics, Volume 280, Issues 1-3, 6 April 2004, Pages 51-63
Abstract
We present a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar (MLNP) subgraph patterns. We show that an MLNP subgraph pattern is completely characterized by either a tree, a level non-planar cycle or a level planar cycle with certain path augmentations.