The complexity of some acyclic improper colourings
type: Item
instance of: scholarly article
title: The complexity of some acyclic improper colourings
zbMATH Open document ID: 1222.05046
author: Mieczysław Borowiecki
author: Katarzyna Jesse-Józefczyk
author: Elżbieta Sidorowicz
published in: Discrete Mathematics
publication date: 2011-05-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5885488
zbMATH Keywords: acyclic colourings
zbMATH Keywords: subcubic graphs
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.disc.2011.01.023
OpenAlex ID: W2068626799
cites work: Q4263464
cites work: Acyclic colorings of graphs with bounded degree
cites work: Q3818315
cites work: Q4198056
cites work: Acyclic colorings of planar graphs
cites work: The NP-completeness of (1,r)-subcolorability of cubic graphs
cites work: The complexity of satisfiability problems
cites work: Acyclic colorings of subcubic graphs
cites work: Partition the vertices of a graph into one independent set and one acyclic set
DOI: 10.1016/J.DISC.2011.01.023
description: scientific article; zbMATH DE number 5885488