Three classes of diameter edge-invariant graphs
Three edge-coloring conjectures
The focus of this article is on three of the author's open conjectures. The article itself surveys results relating to the conjectures and shows where the conjectures are known to hold.
Three new heuristics for the Steiner problem in graphs.
Three-dimensional 1-bend graph drawings.
Three-linking in Eulerian digraphs
Threshold functions for the bipartite Turán property.
Thue-like sequences and rainbow arithmetic progressions.
Tight bounds on the algebraic connectivity of a balanced binary tree.
Tight estimates for eigenvalues of regular graphs.
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.
Tiling parity results and the holey square solution.
Tiling the Torus and Other Space Forms.
Tiling tripartite graphs with 3-colorable graphs.
TimGA: A genetic algorithm for drawing undirected graphs.
Toida's conjecture is true.
Tolerance graphs
Tolerance relations on simple ternary algebras
Tolerances and congruences on tree algebras
Tolerances on graph algebras