Monotone drawings of graphs with few directions
From MaRDI portal
Publication:506161
DOI10.1016/j.ipl.2016.12.004zbMath1401.68241OpenAlexW2566047172MaRDI QIDQ506161
Publication date: 31 January 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.12.004
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Rooted Uniform Monotone Minimum Spanning Trees, Morphing triangle contact representations of triangulations, Optimal Monotone Drawings of Trees, An annotated review on graph drawing and its applications, Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Strictly convex drawings of planar graphs
- Good spanning trees in graph drawing
- Planar graphs and poset dimension
- Algorithms for plane representations of acyclic digraphs
- The book thickness of a graph
- Area requirement and symmetry display of planar upward drawings
- Output-sensitive reporting of disjoint paths
- Monotone drawings of graphs with fixed embedding
- On a conjecture related to geometric routing
- Euclidean Greedy Drawings of Trees
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
- On Monotone Drawings of Trees
- Monotone Drawings of 3-Connected Plane Graphs
- Self-approaching Graphs
- Optimal Monotone Drawings of Trees
- Monotone Drawings of Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Increasing-Chord Graphs On Point Sets
- Convex drawings of planar graphs and the order dimension of 3-polytopes
