We are sometimes interested in connected graphs with only one path between each
pair of vertices. Such graphs are called trees, generalizing the idea of a family tree,
and are considered in Chapter 4. As we shall see, a tree can be defined as a connected
graph containing no cycles (see Fig. 1.10).