full
search.png

Search

close.png

Cancel

arrow
Volume 2, Issue 2
L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting

Yinghua Duan, Hongliang Lu & Qinglin Yu

DOI: 10.4208/eajam.080411.291211a

East Asian J. Appl. Math., 2 (2012), pp. 83-93.

Published online: 2018-02

Preview Full PDF 462017 32746

Cited by

google scholar semantic scholar
Export citation
  • Abstract

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.

  • Keywords

Edge-weighting, vertex-coloring, L-factor.

  • AMS Subject Headings

05C70, 05C15

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{EAJAM-2-83, author = {Yinghua Duan, Hongliang Lu and Qinglin Yu}, title = {L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting}, journal = {East Asian Journal on Applied Mathematics}, year = {2018}, volume = {2}, number = {2}, pages = {83--93}, abstract = {

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.

}, issn = {2079-7370}, doi = {https://doi.org/10.4208/eajam.080411.291211a}, url = {http://global-sci.org/intro/article_detail/eajam/10868.html} }
TY - JOUR T1 - L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting AU - Yinghua Duan, Hongliang Lu & Qinglin Yu 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 -

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.

Yinghua Duan, Hongliang Lu and Qinglin Yu. (2018). L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting. East Asian Journal on Applied Mathematics. 2 (2). 83-93. doi:10.4208/eajam.080411.291211a
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard