Vertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings
复制标题
DOI：
10.1007/s00493-007-0041-6
复制
发表时间：
2007-02
期刊：
影响因子：
1.1
通讯作者：
L. Addario-Berry;Ketan Dalal;C. McDiarmid;B. Reed;A. Thomason
中科院分区：
文献类型：
--
作者：
L. Addario-Berry;Ketan Dalal;C. McDiarmid;B. Reed;A. Thomason
图G的边权W诱导G的顶点着色，其中顶点v的颜色表示为dcv。我们证明了不包含与K2同构的分支的每个图的边都可以从集合{1，.。。，30}使得在生成的顶点着色图OFG中，对于每条边(u，v)OFG，cu≠cv.
A weightingwof the edges of a graphGinduces a colouring of the vertices ofGwhere the colour of vertexv, denotedcv, is. We show that the edges of every graph that does not contain a component isomorphic toK2can be weighted from the set {1, . . . ,30} such that in the resulting vertex-colouring ofG, for every edge (u,v) ofG,cu≠cv.