MaximumIndependentSet[g] finds a largest independent set of graph g.

MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.

MinimumChainPartition[g] partitions partial-order g into a minimum number of chains.

MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.

MultipleEdgesQ[g] yields True if g has multiple edges between pairs of vertices. It yields False otherwise.

MultiplicationTable[l, f] constructs the complete transition table defined by the binary relation function f on the elements of list l.

NextKSubset[l, s] gives the k-subset of list l, following the k-subset s in lexicographic order.

NextSubset[l, s] constructs the subset of l following subset s in canonical order.

NextTableau[t] gives the tableau of shape t, following t in lexicographic order.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.