KMS Of Academy of mathematics and systems sciences, CAS
improvedupperboundsonacyclicedgecolorings | |
Wu Yuwen1; 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. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Wu Yuwen]的文章 |
[Yan Guiying]的文章 |
百度学术 |
百度学术中相似的文章 |
[Wu Yuwen]的文章 |
[Yan Guiying]的文章 |
必应学术 |
必应学术中相似的文章 |
[Wu Yuwen]的文章 |
[Yan Guiying]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论