Parameterized Complexity of Independent Set in H-Free Graphs

Édouard Bonnet, Nicolas Bousquet, Pierre Charbit +2

In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given…