  We show that triangle-free penny graphs have degeneracy at most two, list
coloring number (choosability) at most three, diameter $D=\Omega(\sqrt n)$, and
at most $\min\bigl(2n-\Omega(\sqrt n),2n-D-2\bigr)$ edges.
