Characterization of Unlabeled Level Planar Graphs
From MaRDI portal
Publication:5452208
DOI10.1007/978-3-540-77537-9_7zbMath1137.68484OpenAlexW2084831299MaRDI QIDQ5452208
Stephen G. Kobourov, J. Joseph Fowler
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_7
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Characterization of unlabeled level planar trees ⋮ Planar projections of graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Matched drawability of graph pairs and of graph triples ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Quasi-planar Graphs
This page was built for publication: Characterization of Unlabeled Level Planar Graphs
