1 paper
Paweł Rafał Bieliński, Marta Piecyk, Paweł Rzążewski
The complexity of classical computational problems in graph classes defined by forbidding induced subgraphs is one of the central topics of algorithmic graph theory. Recently, ther…