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

doi:10.1016/j.amc.2017.05.059

CSpace > 应用数学研究所

	The classification of f-coloring of graphs with large maximum degree
	Cai, Jiansheng 1; Yan, Guiying2 ; Zhang, Xia 3
	2017-11-15
发表期刊	APPLIED MATHEMATICS AND COMPUTATION
ISSN	0096-3003
卷号	313 页码:119-121
摘要	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(nu) > 0 for every nu epsilon V. An f-coloring of G is an edge-coloring of it such that each color class appears at every vertex nu epsilon V (G) at most f(nu) times. In this paper, we give a sufficient condition for a simple graph with large maximum degree to be of f-class 1. (C) 2017 Elsevier Inc. All rights reserved.
关键词	Coloring Edge coloring f-Coloring Local Lemma
DOI	10.1016/j.amc.2017.05.059
语种	英语
资助项目	NSFC[11571258] ; NSFC[11371355] ; SDNSF[ZR2016AM01] ; SDNSF[ZR2014JL001]
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000405665500009
出版者	ELSEVIER SCIENCE INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/26171
专题	应用数学研究所
通讯作者	Cai, Jiansheng
作者单位	1.Weifang Univ, Sch Math & Informat Sci, Weifang 261061, Shandong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 3.Shandong Normal Univ, Sch Math, Jinan 250114, Shandong, Peoples R China
推荐引用方式 GB/T 7714	Cai, Jiansheng,Yan, Guiying,Zhang, Xia. The classification of f-coloring of graphs with large maximum degree[J]. APPLIED MATHEMATICS AND COMPUTATION,2017,313:119-121.
APA	Cai, Jiansheng,Yan, Guiying,&Zhang, Xia.(2017).The classification of f-coloring of graphs with large maximum degree.APPLIED MATHEMATICS AND COMPUTATION,313,119-121.
MLA	Cai, Jiansheng,et al."The classification of f-coloring of graphs with large maximum degree".APPLIED MATHEMATICS AND COMPUTATION 313(2017):119-121.