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.

TransitiveQ[g] yields True if graph g defines a transitive relation.

TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.

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.

TransposeTableau[t] reflects a Young tableau t along the main diagonal, creating a different tableau.

TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.