Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:35:33.213Z Has data issue: false hasContentIssue false

L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting

Published online by Cambridge University Press:  28 May 2015

Yinghua Duan*
Affiliation:
Department of Mathematics, Beijing National Day School, Beijing, PR China
Hongliang Lu*
Affiliation:
School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an 710049, PR China
Qinglin Yu*
Affiliation:
Department of Mathematics and Statistics, Thompson Rivers University, Kamloops, BC, Canada
*
Corresponding author. Email: yinghua115@mail.nankai.edu.cn
Corresponding author. Email: luhongliang215@sina.com
Corresponding author. Email: yu@tru.ca
Get access

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.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable