Parameterized coloring problems on chordal graphs
type: Item
instance of: scholarly article
title: Parameterized coloring problems on chordal graphs
zbMATH Open document ID: 1087.68072
author: Dániel Marx
published in: Theoretical Computer Science
publication date: 2006-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5017476
zbMATH Keywords: coloring
zbMATH Keywords: precoloring extension
zbMATH Keywords: parameterized complexity
zbMATH Keywords: chordal graphs
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.008
OpenAlex ID: W2106097003
cites work: Finding and counting given length cycles
cites work: Precoloring extension. I: Interval graphs
cites work: On generalized graphs
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Parameterized complexity of vertex colouring
cites work: Q4393480
cites work: Q3328583
cites work: Q3396009
cites work: Parameterized and Exact Computation
cites work: Q4838466
cites work: Precoloring Extension III: Classes of Perfect Graphs
cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
cites work: Treewidth. Computations and approximations
cites work: Precoloring extension on unit interval graphs
cites work: Q5710169
cites work: Edge coloring nearly bipartite graphs
cites work: Finding odd cycle transversals.
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Algorithms - ESA 2003
DOI: 10.1016/J.TCS.2005.10.008
description: scientific article; zbMATH DE number 5017476