Pages that link to "Item:Q3549262"
From MaRDI portal
The following pages link to Drawability of Complete Graphs Using a Minimal Slope Set (Q3549262):
Displaying 19 items.
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Geometric representation of cubic graphs with four directions (Q833706) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← 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)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- Cubic Graphs Have Bounded Slope Parameter (Q3611836) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- NP-completeness of slope-constrained drawing of complete graphs (Q5132646) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)