GrayCodeSubsets[l] constructs a binary reflected Gray code on set l.

Greedy is a value that the option Algorithm can take in calls to functions such as VertexCover, telling the function to use a greedy algorithm.

Heapify[p] builds a heap from permutation p.

HeapSort[l] performs a heap sort on the items of list l.

HerschelGraph returns a graph object that represents a Herschel graph.

IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.

InvolutionQ[p] yields True if permutation p is its own inverse.

LastLexicographicTableau[p] constructs the last Young tableau with shape described by partition p.

LowerLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

LowerRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.