Drawability of Complete Graphs Using a Minimal Slope Set
From MaRDI portal
Publication:3549262
Recommendations
- NP-completeness of slope-constrained drawing of complete graphs
- scientific article; zbMATH DE number 219263
- Drawings of planar graphs with few slopes and segments
- The Complexity of Drawing Graphs on Few Lines and Few Planes
- The complexity of drawing graphs on few lines and few planes
- Drawings of complete graphs in the projective plane
- scientific article; zbMATH DE number 969977
- Graphs with a minimal number of convex sets
Cited in
(19)- Universal slope sets for 1-bend planar drawings
- Drawing cubic graphs with at most five slopes
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Graph drawings with few slopes
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- NP-completeness of slope-constrained drawing of complete graphs
- Outerplanar graph drawings with few slopes
- Upward planar drawings with three and more slopes
- 1-bend upward planar slope number of SP-digraphs
- Upward planar drawings with two slopes
- Cubic Graphs Have Bounded Slope Parameter
- The planar slope number of planar partial 3-trees of bounded degree
- Drawing planar graphs with few geometric primitives
- Drawing planar graphs with few segments on a polynomial grid
- Upward Planar Drawings with Three and More Slopes
- Geometric representation of cubic graphs with four directions
- Drawing partial 2-trees with few slopes
This page was built for publication: Drawability of Complete Graphs Using a Minimal Slope Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549262)
