 Solution

Let $v_1\cdots v_r$ be a longest path in the finite simple graph. Every neighbour of either endpoint lies on it. Among indices $1\le i<r$, consider those with edges $v_1{v}_{i+1}$ and those with edges $v_i{v}_r$. Their cardinalities are the endpoint degrees, whose sum is at least $n\ge r$, exceeding the $r-1$ available indices. They intersect, producing the cycleEvery connected component has at least $\delta (G)+1>n/2$ vertices, so the graph is connected. If $r<n$, an edge joins a vertex outside this cycle to it, and breaking the cycle there gives a longer path, a contradiction. Hence $r=n$ and this is a Hamilton cycle, proving Dirac theorem.

The complete graph $K_4$ is planar, has chromatic number four and a Hamilton cycle. Adding one leaf attached to one of its vertices preserves planarity and chromatic number four but prevents a Hamilton cycle, since a leaf has degree one.

For the last claim, the given plane embedding has all vertices on the outer cycle. Add noncrossing diagonals until its polygonal interior is triangulated. A triangulated polygon has a vertex incident with only its two boundary neighbours: for example the dual graph of its triangles is a tree and a leaf triangle supplies an ear. Remove this vertex. Inductively three-colour the smaller triangulated polygon, starting with a triangle. The removed vertex's neighbours are adjacent and have different colours, so it can receive the third. Restriction to the original graph givesThis uses the specified embedding, not the false assertion that every planar Hamiltonian graph is three-colourable; $K_4$ is already a counterexample to that broader assertion.