Pages that link to "Item:Q2985120"
From MaRDI portal
The following pages link to Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments (Q2985120):
Displaying 5 items.
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← links)
- Variants of the segment number of a graph (Q2206875) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- Drawing Graphs on Few Circles and Few Spheres (Q4968377) (← links)
- The parametrized complexity of the segment number (Q6618253) (← links)
