The geometric thickness of low degree graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Graph drawings with few slopes
Computational Geometry: Theory and Applications
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Drawing cubic graphs with at most five slopes
GD'06 Proceedings of the 14th international conference on Graph drawing
Really straight graph drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Minimum-segment convex drawings of 3-connected cubic plane graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Drawing planar graphs of bounded degree with few slopes
GD'10 Proceedings of the 18th international conference on Graph drawing
How to draw a Tait-colorable graph
GD'10 Proceedings of the 18th international conference on Graph drawing
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
Drawing cubic graphs with the four basic slopes
GD'11 Proceedings of the 19th international conference on Graph Drawing
Outerplanar graph drawings with few slopes
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if every connected component of G has at least one vertex of degree less than three, then four directions suffice.