Title of article
The complexity of some acyclic improper colourings
Author/Authors
Borowiecki، نويسنده , , Mieczys?aw and Jesse-J?zefczyk، نويسنده , , Katarzyna and Sidorowicz، نويسنده , , El?bieta، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
732
To page
737
Abstract
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.
Keywords
subcubic graphs , graph algorithms , Acyclic colourings
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598399
Link To Document