Fixed-Parameter Tractability of (n − k) List Coloring

Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We consider the list-coloring problem from the perspective of parameterized complexity. In the classical graph coloring problem we are given an undirected graph and the goal is to color the vertices of the graph with minimum number of colors so that end points of each edge get different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored. An interesting parameterization for graph coloring that has been studied is whether the graph can be colored with n − k colors, where k is the parameter and n is the number of vertices. This is known to be fixed parameter tractable. Our main result is that this can be generalized for list-coloring as well. More specifically, we show that, given a graph with each vertex having a list of size n − k, it can be determined in f(k) nO(1) time, for some function f of k, whether there is a coloring that respects the lists.

Original languageEnglish
Pages (from-to)1307-1316
Number of pages10
JournalTheory of Computing Systems
Issue number7
StatePublished - 1 Oct 2020
Externally publishedYes


  • Coloring
  • Fixed Parameter Tractability
  • List Coloring
  • Parameterized Complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Fixed-Parameter Tractability of (n − k) List Coloring'. Together they form a unique fingerprint.

Cite this