Pages that link to "Item:Q2405289"
From MaRDI portal
The following pages link to The complexity of drawing graphs on few lines and few planes (Q2405289):
Displaying 17 items.
- Drawing \(K_{2,n}\): A lower bound (Q1007548) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- 4-connected triangulations on few lines (Q2206872) (← 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)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- Drawability of Complete Graphs Using a Minimal Slope Set (Q3549262) (← links)
- Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- Aligned Drawings of Planar Graphs (Q4961753) (← links)
- Drawing Graphs on Few Circles and Few Spheres (Q4968377) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
- Drawing graphs on few lines and few planes (Q5132649) (← links)
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time (Q5452155) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
