Equilateral Spherical Drawings of Planar Cayley Graphs
From MaRDI portal
Publication:5144883
DOI10.7155/jgaa.00551zbMath1452.05178OpenAlexW3120190963MaRDI QIDQ5144883
Wu-Hsiung Lin, Ming-Hsuan Kang
Publication date: 19 January 2021
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00551
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing trees symmetrically in three dimensions
- Fixed edge-length graph drawing is NP-hard
- Computing straight-line 3D grid drawings of graphs in linear volume
- Vertex-transitive graphs
- Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
- On Spectral Graph Drawing
- Optimal 3D Angular Resolution for Low-Degree Graphs
- Drawing Graphs on Few Circles and Few Spheres
- Computing proximity drawings of trees in the 3-dimensional space
- Pole Dancing: 3D Morphs for Tree Drawings
- An r-Dimensional Quadratic Placement Algorithm
This page was built for publication: Equilateral Spherical Drawings of Planar Cayley Graphs