Pages that link to "Item:Q3142593"
From MaRDI portal
The following pages link to Drawing Graphs in the Plane with High Resolution (Q3142593):
Displaying 29 items.
- The strength of weak proximity (Q849629) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- Signature of power graphs (Q1743077) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- A survey on the distance-colouring of graphs (Q2468029) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
- Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
- Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
- The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
- (Q5111244) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- Triangulations with Circular Arcs (Q5895516) (← links)
- Graphs with large total angular resolution (Q5918989) (← links)
- Graphs with large total angular resolution (Q5925608) (← links)
- Drawing planar graphs with circular arcs (Q5944937) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)
- How to draw a planar clustered graph (Q6064010) (← links)
- The Complexity of Angular Resolution (Q6075714) (← links)
