Δ(G)=9且不含4-圈的平面图的全色数  

Total coloring of C_4-free plane graphs with Δ(G)= 9

作　　者：上官敏乐[1] 王应前[1] 

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

出　　处：《浙江师范大学学报（自然科学版）》2005年第4期379-381,共3页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(10471131);浙江省自然科学基金资助项目(102055)

摘　　要：用Δ(G)表示图G的顶点最大度.对平面图,当Δ(G)≥11时,已证明Vizing和Behzad的图的全色数猜想(TCC)是正确的.运用Discharge方法证明了最大度为9且不含4-圈的平面图的全色数等于10.Let Δ（G） denote the maximum degree of a conjecture to be true for planar graphs, if Δ（G）≥ll. graph with maximum degree 9 and without 4-cycles, graph G. It has been proved that Behzad-Vizing By discharging, it was proved that if G is a plane then its total chromatic number equals to 10.

关 键 词：△(G)=9 不含4-圈 全色数 平面图 

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