Partitioning sparse graphs into an independent set and a graph with bounded size components

Ilkyoo Choi, François Dross, Pascal Ochem

We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these…