Motivated by problems of (among others) Chvátal, Grünbaum, and Thomassen we study hypohamiltonian, graphs. The planar case will play a special role. We also study the connection between hypotraceable and almost hypohamiltonian graphs and related problems such as constructing k-connected graphs in which any j vertices are missed by a longest cycle or path.