cube0004.gif: a path connecting all the vertices of a cube.

This path has 8 vertices and 7 edges. And therefore is also a tree of this cube.

There is a walk between every two vertices. For example there is a walk (DC,CE) between D and E even though they are not directly connected by an edge.

• Cube 1: a graph of a cube.
• Cube 3: a tree of a cube.
• Cube 5: a path that is not a path of this cube.