Skip over navigation
Cube Net
Age 16 to 18
Challenge Level 
How many tours that visit each vertex once and only once can
be traced along the edges of a cube? How many of these tours can
return to the starting point thus completing a Hamiltonian
Circuit?
How many different ways can the subsets of the set $\{a, b,
c\}$ be arranged in a sequence so that each subset differs from the
one before it by having exactly one element inserted or
deleted?
You may also like
Instant Insanity
Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.
Network Trees
Explore some of the different types of network, and prove a result about network trees.
Magic Caterpillars
Label the joints and legs of these graph theory caterpillars so that the vertex sums are all equal.