CSpace  > 应用数学研究所
Wu Yuwen1; Yan Guiying2
Source Publicationactamathematicaeapplicataesinica
AbstractAn 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.
Funding Project[National Natural Science Foundation of China]
Document Type期刊论文
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wu Yuwen]'s Articles
[Yan Guiying]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wu Yuwen]'s Articles
[Yan Guiying]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wu Yuwen]'s Articles
[Yan Guiying]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.