A simple and elementary proof of Whitney's unique embedding theorem

From MaRDI portal



Abstract: 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.












This page was built for publication: A simple and elementary proof of Whitney's unique embedding theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390047)