论文标题
带有4边缘的顶点颜色图
Vertex-coloring graphs with 4-edge-weightings
论文作者
论文摘要
如果加权度得出适当的顶点着色，则图形的边缘加权称为顶点颜色。可以猜想的是，对于没有隔离边缘的每个图，都存在{1,2,3}的顶点颜色的边缘加权。在本说明中，我们表明该语句对于权重集{1,2,3,4}是正确的。
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 edge, a vertex-coloring edge-weighting with the set {1,2,3} exists. In this note, we show that the statement is true for the weight set {1,2,3,4}.
