不含4圈的平面图的无圈边色数的新上界

张埂; 苗连英; 丁伟; 陈晓杰

张埂, 苗连英, 丁伟, 陈晓杰. 不含4圈的平面图的无圈边色数的新上界[J]. 云南大学学报(自然科学版), 2011, 33(6): 634-638,644.

引用本文:

张埂, 苗连英, 丁伟, 陈晓杰. 不含4圈的平面图的无圈边色数的新上界[J]. 云南大学学报(自然科学版), 2011, 33(6): 634-638,644.

ZHANG Geng, MIAO Lian-ying, DING Wei, CHENG Xiao-jie. An upper bound of acyclic edge coloring of planar graphs without 4 cycles[J]. Journal of Yunnan University: Natural Sciences Edition, 2011, 33(6): 634-638,644.

Citation:

ZHANG Geng, MIAO Lian-ying, DING Wei, CHENG Xiao-jie. An upper bound of acyclic edge coloring of planar graphs without 4 cycles[J]. Journal of Yunnan University: Natural Sciences Edition, 2011, 33(6): 634-638,644.

不含4圈的平面图的无圈边色数的新上界

An upper bound of acyclic edge coloring of planar graphs without 4 cycles

摘要

摘要: 为了研究平面图的无圈边染色,利用差值转移方法并结合平面图的结构性质,证明了不含4圈的平面图的无圈边色数不超过Δ(G)+6.

Abstract: In order to study the acyclic edge coloring of planar graphs,in this paper,by using discharging methods and some properties of planar graphs,we proved that if G is a planar graph without 4 cycles,then it’s acyclic chromatic number is no more than Δ(G)+6.

HTML全文

参考文献(1)

资源附件(0)

/