To achieve edge-differential privacy, graph coloring algorithms must have bounded defectiveness, where each vertex can share a color with at most a limited number of its neighbors.
