Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth
arXiv:2412.17756
Abstract
The pathwidth of a graph is the smallest such that can be constructed from a sequence of graphs, each on at most vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth.