Rectilinear Drawings of Famous Graphs

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.

The Petersen Graph 2 Crossings
The Heawood Graph 3 Crossings
The McGee Graph 8 Crossings
The Coxeter Graph 11 Crossings
The Tutte 8-Cage 13 Crossings
The (4,5)-Cage 17 Crossings
The Clebsch Graph, SRG(16,5,0,2) 32 Crossings
The 12-Cage 170 Crossings