Drawing graphs with vertices and edges in convex position
From MaRDI portal
Publication:340526
Recommendations
Cites work
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
- Convex combinatorial optimization
- Convexly independent subsets of the Minkowski sum of planar point sets
- Drawing graphs with vertices and edges in convex position
- Large convexly independent subsets of Minkowski sums
- On the largest convex subsets in Minkowski sums
- The convex dimension of a graph
Cited in
(6)- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
- Graph drawing with morphing partial edges
- The convex dimension of a graph
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- Convexly independent subsets of Minkowski sums of convex polygons
- Drawing graphs with vertices and edges in convex position
This page was built for publication: Drawing graphs with vertices and edges in convex position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340526)