SetPartitions[set] returns the list of set partitions of set. SetPartitions[n] returns the list of set partitions of {1, 2, ..., n}.

SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.

Strings[l, n] constructs all possible combinatorial strings of length n from the elements of list l.

SymmetricGroupIndex[n, x] returns the cycle index of the symmetric group on n symbols, expressed as a polynomial in x[1], x[2], ..., x[n].

ToCycles[p] gives the cycle structure of permutation p as a list of cyclic permutations.

TopologicalSort[g] gives a permutation of the vertices of the directed acyclic graph g such that an edge (i, j) implies that vertex i appears before vertex j.

TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.

VertexConnectivityGraph[g] returns a directed graph that contains an edge corresponding to each vertex in g and in which edge-disjoint paths correspond to vertex-disjoint ...

VertexConnectivity[g] gives the minimum number of vertices whose deletion from graph g disconnects it. VertexConnectivity[g, Cut] gives a set of vertices of minimum size ...

VertexStyle is an option that allows the user to associate different sizes and shapes to vertices.