ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.

FerrersDiagram[p] draws a Ferrers diagram of integer partition p.

FindSet[n, s] gives the root of the set containing n in union-find data structure s.

FiniteGraphs produces a convenient list of all the interesting, finite, parameterless graphs built into Combinatorica.

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

FolkmanGraph returns a smallest graph that is edge-transitive but not vertex-transitive.

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

FruchtGraph returns the smallest 3-regular graph whose automorphism group consists of only the identity.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

GraphComplement[g] gives the complement of graph g.