Pages that link to "Item:Q2385699"
From MaRDI portal
The following pages link to Drawings of planar graphs with few slopes and segments (Q2385699):
Displaying 50 items.
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Visibility drawings of plane 3-trees with minimum area (Q691641) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Geometric representation of cubic graphs with four directions (Q833706) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← 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)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Line and plane cover numbers revisited (Q2206873) (← links)
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Outerplanar graph drawings with few slopes (Q2444313) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- Graph Drawings with One Bend and Few Slopes (Q2802968) (← links)
- A note on minimum-segment drawings of planar graphs (Q2838235) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments (Q2985120) (← links)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Drawability of Complete Graphs Using a Minimal Slope Set (Q3549262) (← links)
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three (Q3611877) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- Experimental Analysis of the Accessibility of Drawings with Few Segments (Q4625100) (← links)
- Experimental Analysis of the Accessibility of Drawings with Few Segments (Q4961757) (← links)
- Drawing Graphs on Few Circles and Few Spheres (Q4968377) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5075349) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- Drawing graphs on few lines and few planes (Q5132649) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Drawing planar graphs of bounded degree with few slopes (Q5891179) (← links)
- Level-planar drawings with few slopes (Q5918472) (← links)
- Universal slope sets for upward planar drawings (Q5918782) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Level-planar drawings with few slopes (Q5918990) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)
