The complexity of some acyclic improper colourings

In this paper we will consider acyclic bipartition of the vertices of graphs, where acyclic means that the edges whose endpoints are in different parts of the partition induce a forest. We will require that the vertices belonging to the same partition induce graphs from particular class. We will search for acyclic bipartitions of cubic and subcubic graphs.