Acyclic Edge Coloring of 4-Regular Graphs (II)
Acyclic Edge Coloring of 4-Regular Graphs (II)
复制标题
DOI：
10.1007/s40840-017-0592-7
复制
发表时间：
2017-12
影响因子：
1.2
通讯作者：
Weifan Wang;Yulai Ma;Qiaojun Shu;Yiqiao Wang
中科院分区：
文献类型：
--
作者：
Weifan Wang;Yulai Ma;Qiaojun Shu;Yiqiao Wang
一个正常的边染色称为无圈的，如果没有双色圈产生。证明了每个具有最大度的简单图都是无圈边可着色的。本文结合一些已知结果，证实了关于图的猜想。
A proper edge coloring is called acyclic if no bichromatic cycles are produced. It was conjectured that every simple graphGwith maximum degreeis acyclically edge--colorable. In this paper, combining some known results, we confirm the conjecture for graphs with.