最大度为6不含相交三角形和4-圈的平面图的全染色  

Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles

作　　者：沈岚[1] 王应前[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2009年第1期45-50,共6页Journal of Zhejiang Normal University:Natural Sciences

基　　金：浙江省教育厅自然科学基金重点项目(20070441)

摘　　要：全染色是对图G的顶点和边同时进行正常染色,至少要用Δ+1个色才能对图G进行正常全染色.运用权转移的方法,证明了最大度为6不含相交三角形和4-圈的简单平面图是7全可染的.It was known that a total coloring of G was coloring the vertices and edges in G simultaneously and properly, at least △＋ 1 colors were needed to color G totally. Using the method of discharging, it was proved that plane graphs with maximum degree six and without intersecting triangles and 4-cycles were 7-totally-colorable.

关 键 词：平面图 全染色 最大度 相交三角形 4-圈 

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