Science, Mathematics, Board Games, Hex, Algorithms.
that our tour starts at u, a vertex of degree 1, and deduced that tours never fork in their journey, it follows that all vertices on the tour have degree at most two. This is because a vertex of degree ≥ 3 would correspond to a fork in the tour which, as we saw, cannot occur. This enables us to