The classification of f-coloring of graphs with large maximum degree

Jiansheng Cai, Guiying Yan and Xia Zhang

Applied Mathematics and Computation, 2017, vol. 313, issue C, 119-121

Abstract: Let G=(V,E) be a simple graph with vertex set V and edge set E. Define an integer-valued function f on V such that f(v) > 0 for every v ∈ V. An f-coloring of G is an edge-coloring of it such that each color class appears at every vertex v ∈ V(G) at most f(v) times. In this paper, we give a sufficient condition for a simple graph with large maximum degree to be of f-class 1.

Keywords: Coloring; Edge coloring; f-Coloring; Local Lemma (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317303715
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:313:y:2017:i:c:p:119-121

DOI: 10.1016/j.amc.2017.05.059

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().