L-factors and adjacent vertex-distinguishing edge-weighting
发布时间：2025-04-30
点击次数：
- 发布时间：
- 2025-04-30
- 论文名称：
- L-factors and adjacent vertex-distinguishing edge-weighting
- 发表刊物：
- East Asia Journal on Applied Mathematics
- 摘要：
- An edge weighting problem of a graph G is an assignment of an integer weight to each
edge e. Based on edge weighting problem, several types of vertex-coloring problems are
put forward. A simple observation illuminates that edge weighting problem has a close
relationship with special factors of graphs. In this paper, we obtain several results on
the existence of factors with the pre-speci¯ed degrees, which generalizes earlier results
in [2, 3]. Using these results, we investigate edge-weighting problem. In particular, we
prove that every 4-colorable graph admits a vertex-coloring 4-edge-weighting.
- 合写作者：
- Y. Duan, H.Lu and Q.Yu
- 是否译文：
- 否
- 发表时间：
- 2012-04-12