A game for 2 people. Take turns joining two dots, until your opponent is unable to move.
Can you solve the clues to find out who's who on the friendship graph?
Investigate how networks can be used to solve a problem for the 18th Century inhabitants of Konigsberg.
How can you decide if a graph is traversable?