Injective coloring of planar graphs with girth 5  

作　　者：Yuehua BU Piaopiao YE 

机构地区：[1]School of Mathematical Sciences,Zhejiang Normal University,Jinhua 321004,China [2]Xingzhi College,Zhejiang Normal University,Jinhua 321004,China

出　　处：《Frontiers of Mathematics in China》2022年第3期473-484,共12页中国高等学校学术文摘·数学（英文）

基　　金：the National Natural Science Foundation of China(No.11771403).

摘　　要：A coloring of a graph G is injective if its restriction to the neighbour of any vertex is injective.The injective chromatic number x_(i)(G)of a graph G is the least k such that there is an injective k-coloring.In this paper,we prove that for each planar graph with g≥5 and Δ(G)≥20,xi(G)≤Δ(G)+3.

关 键 词：Planar graph GIRTH injective coloring FACE 

分 类 号：O18[理学—数学]