Tourism
If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.
If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.
In this game, try not to colour two adjacent regions the same colour. Can you work out a strategy?
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?
Investigate how networks can be used to solve a problem for the 18th Century inhabitants of Konigsberg.
How many different colours of paint would be needed to paint these pictures by numbers?