Sepehr Hajebi, The pathwidth theorem for induced subgraphs
We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H, every …
1 event found.