An inequality involving the vertex arboricity and edge arboricity of a graph
Stefan A. Burr · Journal of Graph Theory · 1986
Abstract Let a(G) and a1(G) denote the vertex arboricity and the edge arboricity of G, respectively. The inequality a(G) ⩽ a1(G) is proved, and this is sharp. Two related inequalities, involving another parameter, are also proved.