Login / Signup

On the parameterized complexity of coloring graphs in the absence of a linear forest.

Jean-François CouturierPetr A. GolovachDieter KratschDaniël Paulusma
Published in: J. Discrete Algorithms (2012)
Keyphrases
  • parameterized complexity
  • graph theory
  • relational databases
  • spanning tree
  • global constraints
  • graph theoretic
  • fixed parameter tractable