Tree (Combinatorica Package Symbol)

Tree is an option that informs certain functions that the user wants the output to be a tree.

TreeToCertificate (Combinatorica Package Symbol)

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 (Combinatorica Package Symbol)

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

TutteGraph (Combinatorica Package Symbol)

TutteGraph returns the Tutte graph, the first known example of a 3-connected, 3-regular, planar graph that is non-Hamiltonian.

Undirected (Combinatorica Package Symbol)

Undirected is an option to inform certain functions that the graph is undirected.

Uniquely3ColorableGraph (Combinatorica Package Symbol)

Uniquely3ColorableGraph returns a 12-vertex, triangle-free graph with chromatic number 3 that is uniquely 3-colorable.

UnitransitiveGraph (Combinatorica Package Symbol)

UnitransitiveGraph returns a 20-vertex, 3-unitransitive graph, discovered by Coxeter, that is not isomorphic to a 4-cage or a 5-cage.

UpperLeft (Combinatorica Package Symbol)

UpperLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

UpperRight (Combinatorica Package Symbol)

UpperRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

VertexColoring (Combinatorica Package Symbol)

VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.