no code implementations • 2 Mar 2021 • Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
We show that, for every non-trivial hereditary class ${\cal G}$, the problem of deciding whether $G\in{\cal G}^{(k)}$ is NP-complete.
Discrete Mathematics Data Structures and Algorithms Combinatorics 05C75, 05C83, 05C75, 05C69 G.2.2; F.2.2
