Graph Puzzles

Challenges are presented here relating to graphs (maps of towns and roads).

Many editing features are available so you can create and redesign solutions.

In the first two challenges, for each graph, you must find a (closed) path that visits every town using no road more than once.

In the next two challenges you must connect each pair of towns using as few board positions as possible.

Seven more challenges relate to vertex-alternating graphs, in which the degrees of adjacent vertices always differ.