23 citations · 61 across the 7 of their papers we have counts for
1 paper · 2 filters
Ralph Keusch
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated…