Slope number
In graph drawing and geometric graph theory, the slope number of a graph is the minimum possible number of distinct slopes of edges in a drawing of the graph in which vertices are represented as points in the Euclidean plane and edges are represented as line segments that do not pass through any nonincident vertex.
Complete graphs
Although closely related problems in discrete geometry had been studied earlier, e.g. by (Scott 1970) and (Jamison 1984), the problem of determining the slope number of a graph was introduced by (Wade Chu), who showed that the slope number of an nvertex complete graph K_{n} is exactly n. A drawing with this slope number may be formed by placing the vertices of the graph on a regular polygon.
Relation to degree
The slope number of a graph of maximum degree d is clearly at least [math]\displaystyle{ \lceil d/2\rceil }[/math], because at most two of the incident edges at a degreed vertex can share a slope. More precisely, the slope number is at least equal to the linear arboricity of the graph, since the edges of a single slope must form a linear forest, and the linear arboricity in turn is at least [math]\displaystyle{ \lceil d/2\rceil }[/math].
Unsolved problem in mathematics: Do the graphs of maximum degree four have bounded slope number? (more unsolved problems in mathematics)

There exist graphs with maximum degree five that have arbitrarily large slope number.^{[1]} However, every graph of maximum degree three has slope number at most four;^{[2]} the result of (Wade Chu) for the complete graph K_{4} shows that this is tight. Not every set of four slopes is suitable for drawing all degree3 graphs: a set of slopes is suitable for this purpose if and only if it forms the slopes of the sides and diagonals of a parallelogram. In particular, any degree 3 graph can be drawn so that its edges are either axisparallel or parallel to the main diagonals of the integer lattice.^{[3]} It is not known whether graphs of maximum degree four have bounded or unbounded slope number.^{[4]}
Planar graphs
As (Keszegh Pach) showed, every planar graph has a planar straightline drawing in which the number of distinct slopes is a function of the degree of the graph. Their proof follows a construction of (Malitz Papakostas) for bounding the angular resolution of planar graphs as a function of degree, by completing the graph to a maximal planar graph without increasing its degree by more than a constant factor, and applying the circle packing theorem to represent this augmented graph as a collection of tangent circles. If the degree of the initial graph is bounded, the ratio between the radii of adjacent circles in the packing will also be bounded by the ring lemma,^{[5]} which in turn implies that using a quadtree to place each graph vertex on a point within its circle will produce slopes that are ratios of small integers. The number of distinct slopes produced by this construction is exponential in the degree of the graph.
Complexity
It is NPcomplete to determine whether a graph has slope number two.^{[6]} From this, it follows that it is NPhard to determine the slope number of an arbitrary graph, or to approximate it with an approximation ratio better than 3/2.
It is also NPcomplete to determine whether a planar graph has a planar drawing with slope number two,^{[7]} and hard for the existential theory of the reals to determine the minimum slope number of a planar drawing.^{[8]}
Notes
 ↑ Proved independently by (Barát Matoušek) and (Pach Pálvölgyi), solving a problem posed by (Dujmović Suderman). See theorems 5.1 and 5.2 of (Pach Sharir).
 ↑ (Mukkamala Szegedy), improving an earlier result of (Keszegh Pach); theorem 5.3 of (Pach Sharir).
 ↑ (Mukkamala Pálvölgyi).
 ↑ (Pach Sharir).
 ↑ (Hansen 1988).
 ↑ (Formann Hagerup); (Eades Hong); (Maňuch Patterson).
 ↑ (Garg Tamassia).
 ↑ (Hoffmann 2016).
References
 Barát, János (2006), "Boundeddegree graphs have arbitrarily large geometric thickness", Electronic Journal of Combinatorics 13 (1): R3, http://www.combinatorics.org/Volume_13/Abstracts/v13i1r3.html.
 "Really straight graph drawings", Graph Drawing: 12th International Symposium, GD 2004, New York, NY, USA, September 29October 2, 2004, Revised Selected Papers, Lecture Notes in Computer Science, 3383, Berlin: SpringerVerlag, 2005, pp. 122–132, doi:10.1007/9783540318439_14.
 "On rectilinear drawing of graphs", Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 2225, 2009, Revised Papers, Lecture Notes in Computer Science, 5849, Berlin: Springer, 2010, pp. 232–243, doi:10.1007/9783642118050_23.
 Formann, M.; Hagerup, T.; Haralambides, J.; Kaufmann, M. (1993), "Drawing graphs in the plane with high resolution", SIAM Journal on Computing 22 (5): 1035–1052, doi:10.1137/0222063.
 Garg, Ashim (2001), "On the computational complexity of upward and rectilinear planarity testing", SIAM Journal on Computing 31 (2): 601–625, doi:10.1137/S0097539794277123.
 Hansen, Lowell J. (1988), "On the Rodin and Sullivan ring lemma", Complex Variables, Theory and Application 10 (1): 23–30, doi:10.1080/17476938808814284.
 Hoffmann, Udo (2016), "The planar slope number", Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG 2016).
 Jamison, Robert E. (1984), "Planar configurations which determine few slopes", Geometriae Dedicata 16 (1): 17–34, doi:10.1007/BF00147419.
 Keszegh, Balázs (2011), "Drawing planar graphs of bounded degree with few slopes", Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 2124, 2010, Revised Selected Papers, Lecture Notes in Computer Science, 6502, Heidelberg: Springer, pp. 293–304, doi:10.1007/9783642184697_27.
 Keszegh, Balázs (2008), "Drawing cubic graphs with at most five slopes", Computational Geometry: Theory and Applications 40 (2): 138–147, doi:10.1016/j.comgeo.2007.05.003.
 Malitz, Seth; Papakostas, Achilleas (1994), "On the angular resolution of planar graphs", SIAM Journal on Discrete Mathematics 7 (2): 172–183, doi:10.1137/S0895480193242931.
 Maňuch, Ján; Patterson, Murray; Poon, SheungHung; Thachuk, Chris (2011), "Complexity of finding nonplanar rectilinear drawings of graphs", Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 2124, 2010, Revised Selected Papers, Lecture Notes in Computer Science, 6502, Heidelberg: Springer, pp. 305–316, doi:10.1007/9783642184697_28.
 Mukkamala, Padmini (2009), "Geometric representation of cubic graphs with four directions", Computational Geometry: Theory and Applications 42 (9): 842–851, doi:10.1016/j.comgeo.2009.01.005.
 Mukkamala, Padmini; Pálvölgyi, Dömötör (2012), "Drawing cubic graphs with the four basic slopes", in van Kreveld, Marc, Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 2123, 2011, Revised Selected Papers, Lecture Notes in Computer Science, 7034, Springer, pp. 254–265, doi:10.1007/9783642258787_25.
 "Boundeddegree graphs can have arbitrarily large slope numbers", Electronic Journal of Combinatorics 13 (1): N1, 2006, http://www.combinatorics.org/Volume_13/Abstracts/v13i1n1.html.
 "5.5 Angular resolution and slopes", Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical Surveys and Monographs, 152, American Mathematical Society, 2009, pp. 126–127.
 Scott, P. R. (1970), "On the sets of directions determined by n points", American Mathematical Monthly 77: 502–505, doi:10.2307/2317384.
 Wade, G. A.; Chu, J.H. (1994), "Drawability of complete graphs using a minimal slope set", The Computer Journal 37 (2): 139–142, doi:10.1093/comjnl/37.2.139.
Original source: https://en.wikipedia.org/wiki/Slope number.
Read more 