3-List-Coloring Planar Graphs of Girth 5

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch′s theorem that every planar graph of girth at least 4 is 3-colorable.