TableauxToPermutation[t_1, t_2] constructs the unique permutation associated with Young tableaux t_1 and t_2, where both tableaux have the same shape.

ThomassenGraph returns a hypotraceable graph, a graph G that has no Hamiltonian path but whose subgraph G - v for every vertex v has a Hamiltonian path.

ToCycles[p] gives the cycle structure of permutation p as a list of cyclic permutations.

TopologicalSort[g] gives a permutation of the vertices of the directed acyclic graph g such that an edge (i, j) implies that vertex i appears before vertex j.

TranslateVertices[v, {x, y}] adds the vector {x, y} to the vertex embedding location of each vertex in list v. TranslateVertices[g, {x, y}] translates the embedding of the ...

TransposePartition[p] reflects a partition p of k parts along the main diagonal, creating a partition with maximum part k.

TreeToCertificate[t] returns a binary string that is a certificate for the tree t such that trees have the same certificate if and only if they are isomorphic.

Turan[n, p] constructs the Turán graph, the extremal graph on n vertices that does not contain CompleteGraph[p].

TwoColoring[g] finds a two-coloring of graph g if g is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.

UnrankBinarySubset[n, l] gives the n\[Null]^th subset of list l, listed in increasing order of integers corresponding to the binary representations of the subsets.