fair coloring 1graph coloring 1neighborhood diversity 1parameterized complexity 1structural graph parameters 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.CC2026
Parameterized Complexity of Fair Coloring Problem
Ramin Javadi, Hossein Shokouhi
The paper studies the fair graph coloring problem, analyzing its parameterized complexity with respect to various structural graph parameters and showing both hardness and fixed-pa…
cs.CC2024
Parameterized Complexity of Fair Many-to-One Matchings
Ramin Javadi, Hossein Shokouhi
Given a bipartite graph , a left-perfect many-to-one matching is a subset such that each vertex in is incident with exactly one edge in . If $…