Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle

Ilkyoo Choi, Haihui Zhang

The vertex arboricity $a(G)$ of a graph $G$ is the minimum $k$ such that $V(G)$ can be partitioned into $k$ sets where each set induces a forest. For a planar graph $G$, it is know…