research
∙
07/12/2021
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
For graphs G and H, we say that G is H-free if it does not contain H as ...
share
research
∙
03/11/2020
Induced subgraphs of bounded treewidth and the container method
A hole in a graph is an induced cycle of length at least 4. A hole is lo...
research
∙
10/21/2019
