I will present a fairly short proof that triangle-free planar graphs can be 3-colored. The proof is by Thomassen and is substantially shorter than the original (and partially incorrect) proof by Groetzsch. If time permits, we can discuss how this proof might be modified to yield a polynomial-time algorithm.