The restrictive H-coloring problem

  • Authors:

  • Josep Díaz;Maria Serna;Dimitrios M. Thilikos

  • Affiliations:

  • Departament de Llenguatges i Sistemes Informítics, Universitat Politècnica de Catalunya, Campus Nord Mòdul C6. c/ Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;Departament de Llenguatges i Sistemes Informítics, Universitat Politècnica de Catalunya, Campus Nord Mòdul C6. c/ Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;Departament de Llenguatges i Sistemes Informítics, Universitat Politècnica de Catalunya, Campus Nord Mòdul C6. c/ Jordi Girona Salgado 1-3, 08034 Barcelona, Spain

  • Venue:
  • Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely the restrictive H-coloring and the restrictive#H-coloring problems, and we provide a dichotomy theorem determining the H's for which the restrictive H-coloring problem is either NP-complete or polynomial time solvable. Moreover, we prove that the same criterion discriminates the #P-complete and the polynomially solvable cases of the restrictive#H-coloring problem. Finally, we show that both our results apply also for the list versions and other extensions of the problems.