IdenticalQ[g, h] yields True if graphs g and h have identical edge lists, even though the associated graphics information need not be the same.
MaximumClique[g] finds a largest clique in graph g. MaximumClique[g, k] returns a k-clique, if such a thing exists in g; otherwise it returns {}.
PerfectQ[g] yields True if g is a perfect graph, meaning that for every induced subgraph of g the size of a largest clique equals the chromatic number.
RGFToSetPartition[rgf, set] converts the restricted growth function rgf into the corresponding set partition of set.
SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.
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.
FromPackedArray[expr] unpacks expr so that its internal representation is not a packed array.
NotebookConvert["name"] converts a Mathematica notebook from a previous version of Mathematica to one for the current version.
AutoLoadNotationPalette specifies whether the Notation palette is opened when the Notation Package is loaded.