23 citations · 61 across the 7 of their papers we have counts for
1 paper · 2 filters
Ralph Keusch
We show that for every graph without isolated edge, the edges can be assigned weights from {1,2,3} so that no two neighbors receive the same sum of incident edge weights. This solv…