On representations of some thickness-two graphs
Computational Geometry: Theory and Applications
Separating Thickness from Geometric Thickness
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
The geometric thickness of low degree graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Graph Treewidth and Geometric Thickness Parameters
Discrete & Computational Geometry
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Drawing cubic graphs with at most five slopes
Computational Geometry: Theory and Applications
Fast generation of regular graphs and construction of cages
Journal of Graph Theory
Geometric representation of cubic graphs with four directions
Computational Geometry: Theory and Applications
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Drawing planar graphs of bounded degree with few slopes
GD'10 Proceedings of the 18th international conference on Graph drawing
Really straight graph drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
The planar slope number of planar partial 3-trees of bounded degree
GD'09 Proceedings of the 17th international conference on Graph Drawing
Outerplanar graph drawings with few slopes
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We show that every cubic graph can be drawn in the plane with straight-line edges using only the four basic slopes, {0,π/4,π/2,3π/4}. We also prove that four slopes have this property if and only if we can draw K4 with them.