Contract[g, {x, y}] gives the graph resulting from contracting the pair of vertices {x, y} of graph g.

Distribution[l, set] lists the frequency of each element of set in list l.

Eulerian[n, k] gives the number of permutations of length n with k runs.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

GraphDifference[g, h] constructs the graph resulting from subtracting the edges of graph h from the edges of graph g.

InduceSubgraph[g, s] constructs the subgraph of graph g induced by the list of vertices s.

Josephus[n, m] generates the inverse of the permutation defined by executing every m\[Null]^th member in a circle of n members.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

MinimumVertexColoring[g] returns a minimum vertex coloring of g. MinimumVertexColoring[g, k] returns a k-coloring of g, if one exists.

NextGrayCodeSubset[l, s] constructs the successor of s in the Gray code of set l.