On the Tractability of (k,i)-Coloring

02/10/2018
by   Saurabh Joshi, et al.
0

In an undirected graph, a proper (k, i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-coloring problem is to compute the minimum number of colors required for a proper (k,i)-coloring. This is a generalization of the classic graph coloring problem. Majumdar et. al. [CALDAM 2017] studied this problem and showed that the decision version of the (k, i)-coloring problem is fixed parameter tractable (FPT) with tree-width as the parameter. They asked if there exists an FPT algorithm with the size of the feedback vertex set (FVS) as the parameter without using tree-width machinery. We answer this in positive by giving a parameterized algorithm with the size of the FVS as the parameter. We also give a faster and simpler exact algorithm for (k,k-1)-coloring, and make progress on the NP-completeness of specific cases of (k,i)-coloring.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2019

Structural Parameterizations for Equitable Coloring

An n-vertex graph is equitably k-colorable if there is a proper coloring...
research
11/22/2022

On Structural Parameterizations of Star Coloring

A Star Coloring of a graph G is a proper vertex coloring such that every...
research
12/18/2019

Estudo comparativo de meta-heurísticas para problemas de colorações de grafos

A classic graph coloring problem is to assign colors to vertices of any ...
research
11/24/2010

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...
research
01/11/2020

Grundy Coloring friends, Half-Graphs, Bicliques

The first-fit coloring is a heuristic that assigns to each vertex, arriv...
research
12/29/2018

A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring

We introduce a dynamic version of the graph coloring problem and prove i...
research
07/28/2019

Parameterized Pre-coloring Extension and List Coloring Problems

Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the p...

Please sign up or login with your details

Forgot password? Click here to reset