CubicalGraph returns the graph corresponding to the cube, a Platonic solid.

Cut is a tag that can be used in a call to NetworkFlow to tell it to return the minimum cut.

Derangements[p] constructs all derangements of permutation p.

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

DodecahedralGraph returns the graph corresponding to the dodecahedron, a Platonic solid.

Edge is an optional argument to inform certain functions to work with edges instead of vertices.

EncroachingListSet[p] constructs the encroaching list set associated with permutation p.

FirstLexicographicTableau[p] constructs the first Young tableau with shape described by partition p.

FromInversionVector[v] reconstructs the unique permutation with inversion vector v.

GraphComplement[g] gives the complement of graph g.