The Honeycomb Problem on the Sphere
  The honeycomb problem on the sphere asks for the perimeter-minimizing partition of the sphere into N equal areas. This article solves the problem when N=12. The unique minimizer is a tiling of 12 regular pentagons in the dodecahedral arrangement. 
Thomas C. Hales