1 paper · 1 filter
Zakir Deniz
A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at a distance at most 2 from each other receive different colors. Recently, Bousquet et al.…