PhD Defence • Algorithms and Complexity • Related Orderings of AT-Free Graphs
Please note: This PhD defence will be given online.
Jan Gorzny, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jonathan Buss
An asteroidal triple (AT) is a triple of independent vertices x, y, z such that between every pair of vertices in the triple, there is a path that does not intersect the closed neighbourhood of the third. A graph without an asteroidal triple is said to be AT-free.
