@article {IOPORT.05984263,
    author       = {Chang, Gerard J. and Lu, Changhong and Wu, Jiaojiao and Yu, Qinglin},
    title        = {Vertex-coloring edge-weightings of graphs.},
    year         = {2011},
    journal      = {Taiwanese Journal of Mathematics},
    volume       = {15},
    number       = {4},
    issn         = {1027-5487},
    pages        = {1807-1813},
    publisher    = {The Mathematical Society of the Republic of China (Taiwan), Chung-Li},
    abstract     = {Summary: A $k$-edge-weighting of a graph $G$ is a mapping $w: E(G)\to\{1,2,\dots,k\}$. An edge-weighting $w$ induces a vertex coloring $f_w: V(G)\to\bbfN$ defined by $$f_w(v)= \sum_{v\in e}w(e).$$ An edge-weighting $w$ is vertex-coloring if $f_w(u)\ne f_w(v)$ for any edge $uv$. The current paper studies the parameter $\mu(G)$, which is the minimum $k$ for which $G$ has a vertex-coloring $k$-edge-weighting. Exact values of $\mu(G)$ are determined for several classes of graphs, including trees and $r$-regular bipartite graph with $r\ge 3$.},
    identifier   = {05984263},
}