Snakes and Ladders: a Treewidth Story

Steven Chaplick, Steven Kelk, Ruben Meuwese +2

Let $G$ be an undirected graph. We say that $G$ contains a ladder of length $k$ if the $2\times (k+1)$ grid graph is an induced subgraph of $G$ that is only connected to the rest…