-shaped point set embeddings of high-degree plane graphs
From MaRDI portal
Publication:5154585
DOI10.1016/j.akcej.2019.06.003zbMath1473.05214OpenAlexW2950439567WikidataQ127640124 ScholiaQ127640124MaRDI QIDQ5154585
Shaheena Sultana, Md. Saidur Rahman
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.06.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bounds for planar orthogonal drawings of graphs
- On embedding an outer-planar graph in a point set
- Orthogeodesic point-set embedding of trees
- Optimal Algorithms to Embed Trees in a Point Set
- Orthogonal Drawings of Plane Graphs Without Bends
- Geometric Graphs in the Plane Lattice
- Graph Drawing