Euler's polyhedral formula - V + F - E = 2 - for convex 3-polytopes and plane connected graphs continues to generate new questions about the structure of plane graphs. This talk will give a survey of what has been done in the past and look at many emerging open questions. In particular, some new results about Hamiltonian circuits for simplicial (all faces triangles) 3-polytopes will be discussed.