4 papers
Almost perfect graph classes
Cicely Henderson, Hidde Koerts, Taite LaGrange +4
A graph is perfect if for each induced subgraph of . In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…
The Twin-Width of Graphs of Bounded VC-Dimension
Therese Biedl, Taite LaGrange, Sophie Spirkl
In this paper, we investigate which hereditary classes of graphs admit sub-linear (in the number of vertices) bounds on twin-width. By modifying conference graphs, we can show that…
The structure of -free tournaments
Seokbeom Kim, Taite LaGrange, Mathieu Rundström +2
We extend the list of tournaments for which the complete structural description for tournaments excluding as a subtournament is known. Specifically, let be a t…
On graphs without four-vertex induced subgraphs
Kathie Cameron, Chính T. Hoàng, Taite LaGrange
Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of colouring (claw, 4K1)- fr…