8 citations · 18 across the 9 of their papers we have counts for
1 paper · 1 filter
Hanna Furmañczyk, Marek Kubale, Vahan V. Mkrtchyan
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The…