The geometric thickness of low degree graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
Drawing planar graphs of bounded degree with few slopes
GD'10 Proceedings of the 18th international conference on Graph drawing
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
The planar slope number of planar partial 3-trees of bounded degree
GD'09 Proceedings of the 17th international conference on Graph Drawing
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 connected cubic graph can be drawn in the plane with straight-line edges using only four distinct slopes and disconnected cubic graphs with five distinct slopes.