Pages that link to "Item:Q2971391"
From MaRDI portal
The following pages link to On the Complexity of the Planar Slope Number Problem (Q2971391):
Displaying 12 items.
- Variants of the segment number of a graph (Q2206875) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Level-planar drawings with few slopes (Q5918472) (← links)
- Level-planar drawings with few slopes (Q5918990) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- The Complexity of Angular Resolution (Q6075714) (← links)
- RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
- Topological art in simple galleries (Q6204773) (← links)
