L-shaped point set embeddings of high-degree plane graphs
DOI10.1016/J.AKCEJ.2019.06.003zbMATH Open1473.05214OpenAlexW2950439567WikidataQ127640124 ScholiaQ127640124MaRDI QIDQ5154585FDOQ5154585
Authors: 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
Recommendations
- On L-shaped point set embeddings of trees: first non-embeddable examples
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Orthogeodesic point-set embedding of trees
- Point-set embeddings of plane 3-trees (extended abstract)
- Improved bounds for drawing trees on fixed points with L-shaped edges
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Algorithms to Embed Trees in a Point Set
- On embedding an outer-planar graph in a point set
- Orthogonal Drawings of Plane Graphs Without Bends
- Lower bounds for planar orthogonal drawings of graphs
- Geometric graphs in the plane lattice
- Orthogeodesic point-set embedding of trees
- Graph Drawing
Cited In (4)
This page was built for publication: \(L\)-shaped point set embeddings of high-degree plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154585)