  In this note we give a short and elementary proof of a more general version
of Whitney's theorem that 3-connected planar graphs have a unique embedding in
the plane. A consequence of the theorem is that cubic plane graphs cannot be
embedded in a higher genus with a simple dual. The aim of this paper is to
promote a simple and elementary proof, which is especially well suited for
lectures presenting Whitney's theorem.
