13 citations · 52 across the 53 of their papers we have counts for
1 paper · 2 filters
L. Sunil Chandran, Anita Das, Davis Issac +1
A well-studied coloring problem is to assign colors to the edges of a graph G so that, for every pair of vertices, all edges of at least one shortest path between them receive di…