L-factors and adjacent vertex-distinguishing edge-weighting
Release Time:2025-04-30
Hits:
- Date:
- 2025-04-30
- Title of Paper:
- L-factors and adjacent vertex-distinguishing edge-weighting
- Journal:
- East Asia Journal on Applied Mathematics
- Summary:
- 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.
- Co-author:
- Y. Duan, H.Lu and Q.Yu
- Translation or Not:
- No
- Date of Publication:
- 2012-04-12