1. Chapter 4
Graphs

2. 4.1 GRAPHS AND THEIR REPRESENTATIONS

9. Other Representations of Graphs

12. Isomorphism

19. 4.2 PATHS AND CIRCUITS
A multigraph consists of a nonempty finite set of vertices and a set of edges, where we allow an edge to join a vertex to itself or to a different vertex, and where we allow several edges joining the same pair of vertices. An edge from a vertex to itself is called a loop. When there is more than one edge between two vertices, these edges are called parallel edges.

27. Euler Circuits and Paths

45. 4.3 SHORTEST PATHS AND DISTANCE

51. Weighted Graphs

61. 4.4 COLORING A GRAPH

74. 4.5 DIRECTED GRAPHS AND MULTIGRAPHS

78. Representations of Directed Graphs

87. Directed Euler Circuits and Paths

91. Directed Hamiltonian Cycles and Paths