Saturated Drawings of Geometric Thickness k
By: Patricia Bachmann , Anna Brötzner , Miriam Goetze and more
Potential Business Impact:
Draws pictures of connections with no extra lines.
We investigate saturated geometric drawings of graphs with geometric thickness $k$, where no edge can be added without increasing $k$. We establish lower and upper bounds on the number of edges in such drawings if the vertices lie in convex position. We also study the more restricted version where edges are precolored, and for $k=2$ the case for vertices in non-convex position.
Similar Papers
On saturated triangulation-free convex geometric graphs
Combinatorics
Finds special shapes with fewest possible lines.
Investigating Simple Drawings of $K_n$ using SAT
Computational Geometry
AI helps solve hard math puzzles about drawings.
On graphs coverable by chubby shortest paths
Combinatorics
Finds patterns in networks for better computer problem-solving.