3 citations · 6 across the 9 of their papers we have counts for
1 paper · 2 filters
Alex Cameron, Jiasheng Yan
We say that a vertex-coloring of a graph is a proper k-distance domatic coloring if for each color, every vertex is within distance k from a vertex receiving that color. The maximu…