KernelLink -- communicate with a Mathematica kernel, MathLink -- low-level methods for communicating with any MathLink program, MathLinkFactory -- create links, ...

LibraryVersionInformation[lib] returns a list of rules of library version information.

EulerianGraphQ[g] yields True if the graph g is Eulerian, and False otherwise.

CliqueQ[g, c] yields True if the list of vertices c defines a clique in graph g.

DistinctPermutations[l] gives all permutations of the multiset described by list l.

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

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

IntervalGraph[l] constructs the interval graph defined by the list of intervals l.

LexicographicPermutations[l] constructs all permutations of list l in lexicographic order.

MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.