Complexity of conflict-free colorings of graphs
type: Item
instance of: scholarly article
title: Complexity of conflict-free colorings of graphs
zbMATH Open document ID: 1317.68071
author: Luisa Gargano
author: Adele A. Rescigno
published in: Theoretical Computer Science
publication date: 2015-01-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6383896
zbMATH Keywords: conflict-free coloring
zbMATH Keywords: NP-completeness
zbMATH Keywords: parametrized algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.11.029
OpenAlex ID: W2033159765
cites work: Online Conflict-Free Colouring for Hypergraphs
cites work: Graph unique-maximum and conflict-free colorings
cites work: Strong conflict-free coloring for intervals
cites work: Improved upper bounds for vertex cover
cites work: Online conflict-free coloring for intervals
cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4393480
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Clique-Width is NP-Complete
cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover
cites work: Q4198056
cites work: Conflict-Free Colouring of Graphs
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Conflict-free coloring of points on a line with respect to a set of intervals
cites work: Algorithmic Meta-theorems for Restrictions of Treewidth
cites work: Q5710169
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Q3002782
DOI: 10.1016/J.TCS.2014.11.029
description: scientific article; zbMATH DE number 6383896