57 citations · 98 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2006★ 57 cited
Drawings of Planar Graphs with Few Slopes and Segments
Vida Dujmovic', David Eppstein, Matthew Suderman +1
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-t…
math.CO2006★ 41 cited
Graph Drawings with Few Slopes
Vida Dujmovic', Matthew Suderman, David R. Wood
The "slope-number" of a graph is the minimum number of distinct edge slopes in a straight-line drawing of in the plane. We prove that for and all large , there…