Data Reduction for Graph Coloring Problems
type: Item
instance of: scholarly article
title: Data Reduction for Graph Coloring Problems
zbMATH Open document ID: 1342.68167
DOI: 10.1007/978-3-642-22953-4_8
author: Bart M. P. Jansen
author: Stefan Kratsch
published in: Fundamentals of Computation Theory
publication date: 2011-08-19T00:00:00Z
full work available at URL: https://arxiv.org/abs/1104.4229
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5940766
MaRDI profile type: Publication
OpenAlex ID: W2962964261
arXiv ID: 1104.4229
cites work: On problems without polynomial kernels
cites work: Q3113681
cites work: Scheduling with incompatible jobs
cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths
cites work: Graph Classes: A Survey
cites work: Parameterized complexity of vertex colouring
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
cites work: On the complexity of some colorful problems parameterized by treewidth
cites work: The complexity ecology of parameters: An illustration using bounded max leaf number
cites work: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
cites work: Intractability of Clique-Width Parameterizations
cites work: Axioms and hulls
cites work: Edge dominating set and colorings on graphs with fixed clique-width
cites work: Q4838453
cites work: Q5365080
cites work: Parameterized coloring problems on chordal graphs
cites work: Graph colorings with local constraints -- a survey
cites work: Some consequences of non-uniform conditions on uniform classes
description: scientific article