MeredithGraph returns a 4-regular, 4-connected graph that is not Hamiltonian, providing a counterexample to a conjecture by C. St. J. A. Nash\[Dash]Williams.

MinimumSpanningTree[g] uses Kruskal's algorithm to find a minimum spanning tree of graph g.

NormalizeVertices[v] gives a list of vertices with a similar embedding as v but with the coordinates of all points scaled to be between 0 and 1.

NthPair[n] returns the n\[Null]^th unordered pair of distinct positive integers, when sequenced to minimize the size of the larger integer. Pairs that have the same larger ...

NumberOfKPaths[g, v, k] returns a sorted list that contains the number of paths of length k to different vertices of g from v.NumberOfKPaths[al, v, k] behaves identically, ...

NumberOfTableaux[p] uses the hook length formula to count the number of Young tableaux with shape defined by partition p.

OddGraph[n] returns the graph whose vertices are the size-(n - 1) subsets of a size-(2 nTraditionalForm\`\[Dash]1) set and whose edges connect pairs of vertices that ...

OrientGraph[g] assigns a direction to each edge of a bridgeless, undirected graph g, so that the graph is strongly connected.

PermuteSubgraph[g, p] permutes the vertices of a subgraph of g induced by p according to p.

SetEdgeLabels[g, l] assigns the labels in l to edges of g.