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.
CITATION STYLE
Joshi, S., Kalyanasundaram, S., Kare, A. S., & Bhyravarapu, S. (2018). On the tractability of (k,i)-coloring. In Communications in Computer and Information Science (Vol. 10743 LNCS, pp. 188–198). Springer Verlag. https://doi.org/10.1007/978-3-319-74180-2_16
Mendeley helps you to discover research relevant for your work.