Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees

Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo +2

The $\text{planar slope number}$ $psn(G)$ of a planar graph $G$ is the minimum number of edge slopes in a planar straight-line drawing of $G$. It is known that $psn(G) \in O(c^Δ)…