Characterization of unlabeled level planar trees
DOI10.1016/j.comgeo.2008.12.006zbMath1180.05099OpenAlexW2165352955MaRDI QIDQ924090
Alejandro Estrella-Balderrama, Stephen G. Kobourov, J. Joseph Fowler
Publication date: 27 July 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.12.006
graph drawingvertex partitionlevel planaritysimultaneous embeddinglevelingplanar drawingULP graphsunlabeled level planarity
Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On simultaneous planar graph embeddings
- A characterization of level planar graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Characterization of Unlabeled Level Planar Trees
- Hierarchies and planarity theory
- Laying Out Graphs Using Queues
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Level Planar Embedding in Linear Time
- The geometric thickness of low degree graphs
- Characterization of Unlabeled Level Planar Graphs
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Minimum Level Nonplanar Patterns for Trees
- Simultaneous Geometric Graph Embeddings
- Graph Drawing
This page was built for publication: Characterization of unlabeled level planar trees