内江师范学院学报
內江師範學院學報
내강사범학원학보
JOURNAL OF NEIJIANG TEACHERS COLLEGE
2012年
2期
17-21
,共5页
无圈边染色%平面图%相交三角形
無圈邊染色%平麵圖%相交三角形
무권변염색%평면도%상교삼각형
acyclic edge coloring%planar graph%intersecting triangles
如果图G的正常边染色不包含2-色圈,则称它是图G的一个无圈边染色.图G的无圈边色数表示图G的无圈边染色所需的最小颜色数.为研究平面图的无圈边色数的上界,利用差值转移方法并结合平面图的结构性质,证明了不含相交三角形的平面图的无圈边色数不超过Δ(G)+7.
如果圖G的正常邊染色不包含2-色圈,則稱它是圖G的一箇無圈邊染色.圖G的無圈邊色數錶示圖G的無圈邊染色所需的最小顏色數.為研究平麵圖的無圈邊色數的上界,利用差值轉移方法併結閤平麵圖的結構性質,證明瞭不含相交三角形的平麵圖的無圈邊色數不超過Δ(G)+7.
여과도G적정상변염색불포함2-색권,칙칭타시도G적일개무권변염색.도G적무권변색수표시도G적무권변염색소수적최소안색수.위연구평면도적무권변색수적상계,이용차치전이방법병결합평면도적결구성질,증명료불함상교삼각형적평면도적무권변색수불초과Δ(G)+7.
Given that a proper edge coloring of G contains no bichromatic cycles inG,then it is an acyclic edge coloring of G.The acyclic chromatic number of G is the minimum number of colors among all the acyclic edge colorings of G.In order to study the upper bound of acyclic chromatic number of planar graphs,by using discharging methods and some properties of planar graphs,the paper has proved that if G is a planar graph without intersecting triangles,then its acyclic chromatic number will be not more than G.