不含5-圈的平面图的无圈边着色  

Acyclic edge coloring of planar graphs without 5-cycles

作　　者：吴燕青[1,2] 谢德政[2] 赵灿鸟[2] 

机构地区：[1]山西师范大学数学系,山西临汾041000 [2]重庆大学数学与统计学院,重庆401331

出　　处：《纯粹数学与应用数学》2012年第3期342-348,共7页Pure and Applied Mathematics

摘　　要：图G的一个无圈边着色是一个正常的边着色且不含双色的圈.图G的无圈边色数是图G的无圈边着色中所用色数的最小者.本文用反证法得到了不含5-圈的平面图G的无圈边色数的一个上界.An acyclic edge coloring of a graph G is a proper edge coloring such that there axe no bichromatic cycles. The acyclic edge chromatic number of a graph G is the least number of colors in an acyclic edge coloring of G. In this paper, an upper bound on the acyclic edge chromatic number for planar graphs without 5-cycles was obtained using proof of contradiction.

关 键 词：无圈边着色 无圈边色数 平面图 

分 类 号：O157.5[理学—数学]