63 search results - page 1 / 13 » Cubic Graphs Have Bounded Slope Parameter |
GD
2008
Springer
13 years 8 months ago
2008
Springer
GD
2004
Springer
14 years 1 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
COMBINATORICS
2006
13 years 7 months ago
2006
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
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-...
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...