2026/07/29 by Ramin Javadi, Hossein Shokouhi
Computer Science · #cs.CC #msc:68Q27
arxiv created 2026/07/29 · arxiv updated 2026/07/30
Given a graph G=(V,E), a (proper) k-coloring for G is a vertex coloring with k colors such that every two adjacent vertices receive different colors. Suppose that the vertex set V is partitioned into some groups, a proper coloring is called fair if for every color class, the difference between the number of vertices in any two groups does not exceed a given threshold. In this paper, we investigate the parameterized complexity of the fair coloring problem with respect to the structural parameters of the input graph. In particular, we prove that the problem is W[1]-hard with respect to the number of groups for forests and also graphs of modular-width two, even when the number of colors is equal to two. On the positive side, we prove that when the number of colors is equal to two, then the problem is FPT with respect to neighborhood diversity of the input graph. Moreover, in general, the problem is FPT with respect to neighborhood diversity and the number of groups. As a by-product, we prove that unary vector bin packing problem is W[1]-hard with respect to the dimension.