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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.