FPT algorithms to compute the elimination distance to bipartite graphs and more

DOI10.1007/978-3-030-86838-3_6MaRDI QIDQ2672425

Bart M. P. Jansen, Jari J. H. de Kroon

Publication date: 8 June 2022

Full work available at URL: https://arxiv.org/abs/2106.04191

zbMATH Keywords

FPT; odd cycle transversal; elimination distance

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science