Given a graph G, we define the degree of a vertex v to be the number of edges in G incident to v (ie: the number of edges having v as an endpoint).

In this graph, vertices b and c has degree 3. Vertex m has degree 0.

Back to the Parallel Mountain Climbers problem