围长至少为6平面图的injective-染色  

Injective coloring of planar graphs with girth at least 6

作　　者：卜月华[1,2] 杨强 BU Yuehua;YANG Qiang(School of Mathematical Sciences,Zhejiang Normal University,Jinhua 321004,China;Xingzhi College,Zhejiang Normal University,Lanxi 321100,China)

机构地区：[1]浙江师范大学数学科学学院,浙江金华321004 [2]浙江师范大学行知学院,浙江兰溪321100

出　　处：《浙江师范大学学报（自然科学版）》2023年第2期121-131,共11页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(11771403,11871439)。

摘　　要：为了进一步探究平面图的injective-染色,通过分析临界图的结构性质并利用权转移方法,证明了围长至少为6,Δ(G)≥9且6-圈与6-圈不交的平面图G,有χ_(i)(G)≤Δ(G)+1.所得结果推广了平面图injective-染色的已知结果.In order to investigate the injective-coloring of planar graphs,the injective-chromatic number of planar graphs with girth at least 6,maximum degree at least 9 and in which 6-cycle and 6-cycle were disjoint was studied by using the structure property of critical graphs and discharge.It was proved that the upper bound was at mostχ_(i)(G)≤Δ(G)+1.The presented result generalized the known results of injective-coloring of planar graphs.

关 键 词：injective-染色 平面图 围长 最大度 

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