The authors consider drawings of graphs in the plane such that edges are straight line segments and the minimum angle formed by any pair of incident edges is as large as possible; this maximum is called a resolution of a graph. For any graph with maximum valency \(d\) the resolution \(R\) of the graph satisfies the inequality \(\Omega(d^{-2})\leq R\leq 2\pi/d\). Examples of various classes of graphs are exhibited for which \(R=\Theta(1/d)\), or \(R=O(d^{-2}\log d)\). It is also shown that the problem of deciding if \(R=2\pi/d\) for a graph is NP-hard for \(d=4\).