The Parameterized Complexity of Computing the Linear Vertex Arboricity

Alexander Erhardt, Alexander Wolff

The \emph{linear vertex arboricity} of a graph is the smallest number of sets into which the vertices of a graph can be partitioned so that each of these sets induces a linear fore…