License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2020.19
URN: urn:nbn:de:0030-drops-118801
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11880/
Go to the corresponding LIPIcs Volume Portal

Gutin, Gregory ; Majumdar, Diptapriyo ; Ordyniak, Sebastian ; Wahlström, Magnus

Parameterized Pre-Coloring Extension and List Coloring Problems

pdf-format:
LIPIcs-STACS-2020-19.pdf (0.5 MB)

Abstract

Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of the following problems parameterized by k: (1) Given a graph G, a clique modulator D (a clique modulator is a set of vertices, whose removal results in a clique) of size k for G, and a list L(v) of colors for every v ∈ V(G), decide whether G has a proper list coloring; (2) Given a graph G, a clique modulator D of size k for G, and a pre-coloring λ_P: X → Q for X ⊆ V(G), decide whether λ_P can be extended to a proper coloring of G using only colors from Q. For Problem 1 we design an O*(2^k)-time randomized algorithm and for Problem 2 we obtain a kernel with at most 3k vertices. Banik et al. (IWOCA 2019) proved the following problem is fixed-parameter tractable and asked whether it admits a polynomial kernel: Given a graph G, an integer k, and a list L(v) of exactly n-k colors for every v ∈ V(G), decide whether there is a proper list coloring for G. We obtain a kernel with O(k²) vertices and colors and a compression to a variation of the problem with O(k) vertices and O(k²) colors.

BibTeX - Entry

@InProceedings{gutin_et_al:LIPIcs:2020:11880,
  author =	{Gregory Gutin and Diptapriyo Majumdar and Sebastian Ordyniak and Magnus Wahlstr{\"o}m},
  title =	{{Parameterized Pre-Coloring Extension and List Coloring Problems}},
  booktitle =	{37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
  pages =	{19:1--19:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-140-5},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{154},
  editor =	{Christophe Paul and Markus Bl{\"a}ser},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11880},
  URN =		{urn:nbn:de:0030-drops-118801},
  doi =		{10.4230/LIPIcs.STACS.2020.19},
  annote =	{Keywords: Parameterized Algorithms, W-hardness, Kernelization, Graph Coloring, List Coloring}
}

Keywords: Parameterized Algorithms, W-hardness, Kernelization, Graph Coloring, List Coloring
Collection: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Issue Date: 2020
Date of publication: 04.03.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI