Minimum conflict free colouring parameterized by treewidth
type: Item
instance of: scholarly article
title: Minimum conflict free colouring parameterized by treewidth
zbMATH Open document ID: 1453.68094
DOI: 10.1007/978-3-030-39219-2_35
author: Pradeesha Ashok
author: Rathin Bhargava
author: Naman Gupta
author: Mohammad Khalid
author: Dolly Yadav
publication date: 2020-07-21T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7223715
zbMATH Keywords: conflict-free colouring of graphs
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT algorithms
zbMATH Keywords: treewidth
zbMATH Keywords: exponential time hypothesis
zbMATH Keywords: strong exponential time hypothesis
MaRDI profile type: Publication
full work available at URL: 978-3-030-39219-2 35
OpenAlex ID: W3002321458
Recommended article: Structural parameterization for minimum conflict-free colouring
Recommended article: Parameterized complexity of conflict-free graph coloring
Recommended article: Parameterized Complexity of Conflict-Free Graph Coloring
Recommended article: Parameterized algorithms for conflict-free colorings of graphs
Recommended article: Tree-coloring problems of bounded treewidth graphs
Recommended article: Complexity of conflict-free colorings of graphs
Recommended article: Conflict-Free Colouring of Graphs
Recommended article: Conflict-free coloring: graphs of bounded clique width and intersection graphs
Recommended article: On the Complexity of Some Colorful Problems Parameterized by Treewidth
Recommended article: On the complexity of some colorful problems parameterized by treewidth
description: scientific article; zbMATH DE number 7223715