TY - JOUR
T1 - L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting
JO - East Asian Journal on Applied Mathematics
VL - 2
SP - 83
EP - 93
PY - 2018
DA - 2018/02
SN - 2
DO - http://doi.org/10.4208/eajam.080411.291211a
UR - https://global-sci.org/intro/article_detail/eajam/10868.html
KW - Edge-weighting, vertex-coloring, L-factor.
AB - <p style="text-align: justify;">An edge-weighting problem of a graph G is an assignment of an integer
weight to each edge e. Based on an edge-weighting problem, several types of vertex-coloring
problems are put forward. A simple observation illuminates that the edge-weighting
problem has a close relationship with special factors of the graphs. In this
paper, we generalise several earlier results on the existence of factors with pre-specified
degrees and hence investigate the edge-weighting problem — and in particular, we
prove that every 4-colorable graph admits a vertex-coloring 4-edge-weighting.</p>