Ararat Harutyunyan

Abstract: Given a graph G, the vertex-arboricity of G, denoted by a(G), is the smallest integer k such that V(G) can be partitioned into k sets each of which induces an acyclic subgraph. This notion relates to the chromatic number of a graph, and was...