2-Distance Colorings of Integer Distance Graphs

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…