improvedupperboundsonacyclicedgecolorings

CSpace > 应用数学研究所

	improvedupperboundsonacyclicedgecolorings
	Wu Yuwen 1; Yan Guiying2
	2014
发表期刊	actamathematicaeapplicataesinica
ISSN	0168-9673
卷号	30 期号:2 页码:305
摘要	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]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/49464
专题	应用数学研究所
作者单位	1.北京物资学院 2.中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Wu Yuwen,Yan Guiying. improvedupperboundsonacyclicedgecolorings[J]. actamathematicaeapplicataesinica,2014,30(2):305.
APA	Wu Yuwen,&Yan Guiying.(2014).improvedupperboundsonacyclicedgecolorings.actamathematicaeapplicataesinica,30(2),305.
MLA	Wu Yuwen,et al."improvedupperboundsonacyclicedgecolorings".actamathematicaeapplicataesinica 30.2(2014):305.