Parameterized Coloring Problems on Threshold Graphs
Data Structures and Algorithms
2020-05-29 v3 Discrete Mathematics
Abstract
In this paper, we study several coloring problems on graphs from the viewpoint of parameterized complexity. We show that Precoloring Extension is fixed-parameter tractable (FPT) parameterized by distance to clique and Equitable Coloring is 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.
Cite
@article{arxiv.1910.10364,
title = {Parameterized Coloring Problems on Threshold Graphs},
author = {I. Vinod Reddy},
journal= {arXiv preprint arXiv:1910.10364},
year = {2020}
}
Comments
12pages, latest version