Search Results

You are looking at 1 - 1 of 1 items for

  • Author: Brahim Benmedjdoub x
Clear All Modify Search
Open access

Brahim Benmedjdoub, Isma Bouchemakh and Éric Sopena


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-distance chromatic number χ 2(G) of G is then the smallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d 1, . . ., d}, the integer distance graph G = G(D) is the infinite graph defined by V (G) = ℤ and uvE(G) if and only if |vu| ∈ D. We study the 2-distance chromatic number of integer distance graphs for several types of sets D. In each case, we provide exact values or upper bounds on this parameter and characterize those graphs G(D) with χ2(G(D)) = ∆(G(D)) + 1.