20 citations · 22 across the 6 of their papers we have counts for
1 paper · 1 filter
Brahim Benmedjdoub, Eric Sopena, Isma Bouchemakh
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-dis…