EulerianCycle[g] finds an Eulerian cycle of g if one exists.

ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.

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.

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

GraphComplement[g] gives the complement of graph g.

GraphProduct[g_1, g_2, ...] constructs the product of graphs g_1, g_2, and so forth.

GrayCodeKSubsets[l, k] generates k-subsets of l in Gray code order.

HamiltonianPath[g] finds a Hamiltonian path in graph g if one exists. HamiltonianPath[g, All] gives all Hamiltonian paths of graph g.

HasseDiagram[g] constructs a Hasse diagram of the relation defined by directed acyclic graph g.