5 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Oylum Şeker, Tınaz Ekim, Z. Caner Taşkın
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into…