The $k$-strong induced arboricity of a graph

Maria Axenovich, Daniel Goncalves, Jonathan Rollin +1

The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edge…