Hex
Francis Tseng
Info

Let G be a planar 2-connected graph in which all vertices have degree 2 or 3. Each area within G corresponds to a cell on a Hex board. We can assume that all cells are occupied because a game of Hex cannot end before a player wins or no cell is available.

Connections