Induced and Weak Induced Arboricities

Maria Axenovich, Philip Dörr, Jonathan Rollin +1

We define the induced arboricity of a graph $G$, denoted by $\mathrm{ia}(G)$, as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$. This notio…