Acyclic coloring of graphs with some girth restriction

doi:10.1007/s10878-015-9829-2

CSpace > 应用数学研究所

	Acyclic coloring of graphs with some girth restriction
	Cai, Jiansheng 1; Feng, Binlu 1; Yan, Guiying2
	2016-05-01
发表期刊	JOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN	1382-6905
卷号	31 期号:4 页码:1399-1404
摘要	A vertex coloring of a graph is called acyclic if it is a proper vertex coloring such that every cycle receives at least three colors. The acyclic chromatic number of is the least number of colors in an acyclic coloring of . We prove that acyclic chromatic number of any graph with maximum degree and with girth at least is at most 2 Delta.
关键词	Graph Girth Coloring Acyclic coloring Local lemma
DOI	10.1007/s10878-015-9829-2
语种	英语
资助项目	NSFSD[ZR2013AM001] ; NSFSD[ZR2013AL016] ; NSFC[11371355]
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Interdisciplinary Applications ; Mathematics, Applied
WOS记录号	WOS:000373574300003
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/22442
专题	应用数学研究所
通讯作者	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
推荐引用方式 GB/T 7714	Cai, Jiansheng,Feng, Binlu,Yan, Guiying. Acyclic coloring of graphs with some girth restriction[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2016,31(4):1399-1404.
APA	Cai, Jiansheng,Feng, Binlu,&Yan, Guiying.(2016).Acyclic coloring of graphs with some girth restriction.JOURNAL OF COMBINATORIAL OPTIMIZATION,31(4),1399-1404.
MLA	Cai, Jiansheng,et al."Acyclic coloring of graphs with some girth restriction".JOURNAL OF COMBINATORIAL OPTIMIZATION 31.4(2016):1399-1404.