Characterization of Unlabeled Level Planar Trees

DOI10.1007/978-3-540-70904-6_35zbMath1185.68473OpenAlexW1973676336MaRDI QIDQ3595451

Alejandro Estrella-Balderrama, Stephen G. Kobourov, J. Joseph Fowler

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_35

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ 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 ⋮ Graph Simultaneous Embedding Tool, GraphSET

This page was built for publication: Characterization of Unlabeled Level Planar Trees