Vertex-coloring graphs with 4-edge-weightings

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…