Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs

Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen

Abstract: Highlights•We formulate the Inductive Recognition technique.•This technique gives FPT algorithms for Monopolar Recognition and 2-Subcoloring.•We extend these FPT algorithms to further vertex-partition problems.•The respective parameters are smaller than the size of the partite sets.•We obtain hardness results for many vertex-partition problems.