Parameterized Coloring Problems on Threshold Graphs

10/23/2019
by   I. Vinod Reddy, et al.
0

In this paper, we study several coloring problems on graphs from the viewpoint of parameterized complexity. We show that Precoloring Extension and Equitable Coloring problems are fixed-parameter tractable (FPT) parameterized by the distance to threshold graphs. We also study the List k-Coloring and show that the problem is NP-complete on split graphs and it is FPT parameterized by solution size on split graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2022

b-Coloring Parameterized by Pathwidth is XNLP-complete

We show that the b-Coloring problem is complete for the class XNLP when ...
research
10/11/2020

On Structural Parameterizations of Load Coloring

Given a graph G and a positive integer k, the 2-Load coloring problem is...
research
05/31/2021

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Let XNLP be the class of parameterized problems such that an instance of...
research
05/06/2020

A Parameterized Perspective on Attacking and Defending Elections

We consider the problem of protecting and manipulating elections by reco...
research
06/24/2020

Kernelization of Whitney Switches

A fundamental theorem of Whitney from 1933 asserts that 2-connected grap...
research
07/18/2022

Robust Factorizations and Colorings of Tensor Graphs

Since the seminal result of Karger, Motwani, and Sudan, algorithms for a...
research
10/04/2020

On decidability of hyperbolicity

We prove that a wide range of coloring problems in graphs on surfaces ca...

Please sign up or login with your details

Forgot password? Click here to reset