Science, Mathematics, Board Games, Hex, Algorithms.
finite, the tour must terminate. The only possible vertices at which the tour can terminate are: v and v’. This is because v and v’ are of degree 1 and a tour starting at u is necessarily a simple path and must thus end at a vertex of degree 1. Although vertices u and u′ are also of degree 1,