April 30, 2026
Leah Miller '26 will present "T-Colorings of Annular and Wheel Digraphs". Pizza provided & everyone welcome to attend.
Graph coloring is an important application in the graph theory literature dating back to 1852. A variant called T-colorings were introduced by Hale (1980) to help solve the frequency assignment problem. This is the problem of assigning frequencies to avoid interference of “close” transmitters. In this talk, we consider T-colorings of directed graphs. This addresses the frequency assignment problem when transmitters send out “directed” transmissions. We will consider optimal T-colorings of annular and wheel digraphs where optimality is based on the span of a T-coloring, i.e, the absolute difference between its largest and smallest colors.
Further information
- Location: Tome 115
- Time: 12:00 pm - 1:00 pm
- Cost: Free