This problem is about investigating whether it is possible to start at one vertex of a platonic solid and visit every other vertex once only returning to the vertex you started at.
Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?
A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start.
How many Hamiltonian circuits can you find in these graphs?
Published February 2000,February 2011.