
 Graph Theory Glossary 
  For example, Figure 1.3.8 shows a simple graph which is also a bipartite graph because it may be divided into two parts, given by the subsets {1, 2} and {3, 4, 5}, where every edge in the graph goes from a vertex in one part to a vertex in the other part. 
  In the graph shown in Figure 1.3.14 a, cycles are represented, for example, by sequences of vertices 1, 5, 4, 2, 3, 4, 1 and 1, 2, 3, 4, 5, 1. 
  The vertices of the graph shown in Figure 1.3.29 may be properly colored in four colors: the first color for vertex 1, the second color for vertices 2, and 7, the third color for vertices 4, and 5, and the fourth color for vertices 3, and 6. 
 exchange.manifold.net /manifold/manuals/5_userman/mfd50Graph_Theory_Glossary.htm (3582 words) 
