The complexity of some acyclic improper colourings

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 sea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2011-05, Vol.311 (8), p.732-737
Hauptverfasser: Borowiecki, Mieczysław, Jesse-Józefczyk, Katarzyna, Sidorowicz, Elżbieta
Format: Artikel
Sprache:eng
Schlagworte:
Acyclic colourings
Algebra
Applied sciences
Colouring
Combinatorics
Combinatorics. Ordered structures
Complexity
Computer science
control theory
systems
Exact sciences and technology
Forests
Graph algorithms
Graphs
Information retrieval. Graph
Mathematical analysis
Mathematics
Partitions
Sciences and techniques of general use
Searching
Subcubic graphs
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2011.01.023