Below are some (rectilinear) drawings of some well-known trivalent graphs which we believe have the minimum possible number of crossings. For the first two cases, it is easy to prove minimality.