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.

MycielskiGraph[k] returns a triangle-free graph with chromatic number k, for any positive integer k.

NextComposition[l] constructs the integer composition that follows l in a canonical order.

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

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

NextLexicographicSubset[l, s] gives the lexicographic successor of subset s of set l.

NextPartition[p] gives the integer partition following p in reverse lexicographic order.

NextPermutation[p] gives the permutation following p in lexicographic order.

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