Drawings of planar graphs with few slopes and segments (Q2385699)

Some results on planar graphs are proved in this paper. One is a characterization of plane drawings with a segment between every pair of vertices, which are the ones with the least number of segments. The article is mainly devoted to obtain lower and upper bounds on the minimum number of segments and slopes in (plane) drawings of graphs. The results are summarized in a table for nine graph families. The main result for \(3\)-connected plane graphs states that all of them with \(n\) vertices have a plane drawing with at most \(5n/2-3\) segments and at most \(2n-10\) slopes.