Copyright © University of Cambridge. All rights reserved.

'Tourism' printed from http://nrich.maths.org/

Show menu


If you can copy a network

  • without lifting your pen off the paper

  • without drawing any line twice

then it is traversable.

 

Decide which of these diagrams are traversable.

 

diagrams with tours and circuits

 

 

If you end up where you started when you draw a traversable diagram it is called a traversing circuit .

If you don't end up where you started when you draw a traversable diagram it is called a traversing path.

Can you give a set of criteria for determining whether a diagram is traversable by a path or a circuit or neither?