On the Complexity of Some Colorful Problems Parameterized by Treewidth
- 28 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 366-377
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Software Engineering for Multi-Agent Systems V2007
- Equitable colorings of bounded treewidth graphsTheoretical Computer Science, 2005
- A list analogue of equitable coloringJournal of Graph Theory, 2003
- New trends in the theory of graph colorings: Choosability and list coloring1999
- Parameterized Complexity1999
- Generalized coloring for tree-like graphsDiscrete Applied Mathematics, 1997
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph familiesAlgorithmica, 1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Equitable ColoringThe American Mathematical Monthly, 1973