12 citations · 46 across the 32 of their papers we have counts for
1 paper · 2 filters
Mickael Montassier, Pascal Ochem
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree a…