Can you solve the clues to find out who's who on the friendship graph?
Can you find a way to connect each house to the utilities without any pipes crossing?
How can you decide if a graph is traversable?
Some simple ideas about graph theory with a discussion of a proof
of Euler's formula relating the numbers of vertces, edges and faces
of a graph.