The Parameterized Complexity of Graph Cyclability

Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis +1

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative inte…