Improved Upper Bounds on Acyclic Edge Colorings

CORC > 数学与系统科学研究院 > 中国科学院数学与系统科学研究院 > 应用数学研究所

	Improved Upper Bounds on Acyclic Edge Colorings
	Wu Yuwen 1; Yan Guiying 2
刊名	ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
	2014
卷号	30 期号:2 页码:305-308
关键词	graph coloring acyclic edge coloring Lovasz local lemma
ISSN号	0168-9673
其他题名	Improved upper bounds on acyclic edge colorings
英文摘要	An acyclic edge coloring of a graph is a proper edge coloring such that every cycle contains edges of at least three distinct colors. The acyclic chromatic index of a graph G, denoted by a'(G), is the minimum number k such that there is an acyclic edge coloring using k colors. It is known that a'(G) <= 16 del for every graph G where del denotes the maximum degree of G. We prove that a'(G) < 13.8 del for an arbitrary graph G. We also reduce the upper bounds of a'(G) to 9.8 del and 9 del with girth 5 and 7, respectively.
资助项目	[National Natural Science Foundation of China]
语种	英语
CSCD记录号	CSCD:5102536
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/54754]
专题	应用数学研究所
作者单位	1.北京物资学院 2.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Wu Yuwen,Yan Guiying. Improved Upper Bounds on Acyclic Edge Colorings[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2014,30(2):305-308.
APA	Wu Yuwen,&Yan Guiying.(2014).Improved Upper Bounds on Acyclic Edge Colorings.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,30(2),305-308.
MLA	Wu Yuwen,et al."Improved Upper Bounds on Acyclic Edge Colorings".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 30.2(2014):305-308.