平面图的单射染色  

Injective Coloring of Planar Graphs

作　　者：朱海洋[1] 王淑玲[2] 刘嫚[2] 吕新忠[3] ZHU Hai-yang WANG Shu-ling LIU Man LV Xin-zhong(Department of Flight Support Command,Air Force Logistics College,Xuzhou Jiangsu 221000,China Department of Basic Courses , Air Force Logistics College, Xuzhou Jiangsu 221000 , China College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua Zhejiang 321004,China)

机构地区：[1]空军勤务学院飞行保障指挥系,江苏徐州221000 [2]空军勤务学院基础部,江苏徐州221000 [3]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《西南师范大学学报（自然科学版）》2017年第4期7-13,共7页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61170302)

摘　　要：利用欧拉公式和权转移规则,证明了:若G为最大度Δ(G)≤6且不含4,5,6,7-圈的平面图,则图G的单射色数的上界为Δ(G)+5.With Euler’s formula and Discharging Rules, it has been proved that if G be a planar graph with maximum degree △（G）≤6 and without 4,5,6,7-cycles, then the upper bound of injective chromatic num-ber of G is △（G） ＋ 5.

关 键 词：平面图 单射染色 单射色数 圈 

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