A characterization of level planar graphs
From MaRDI portal
Publication:1827672
DOI10.1016/j.disc.2003.02.001zbMath1042.05029OpenAlexW1981217929MaRDI QIDQ1827672
Sebastian Leipert, Ago Kuusik, Patrick Healy
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.02.001
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (10)
Beyond Level Planarity ⋮ Characterization of unlabeled level planar trees ⋮ Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Data Structures and their Planar Graph Layouts ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Strip planarity testing for embedded planar graphs ⋮ Matched drawability of graph pairs and of graph triples ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Multilevel Planarity
Cites Work
This page was built for publication: A characterization of level planar graphs
