不含相交5-圈的平面图的单射染色  

Injective coloring of planar graphs without intersecting 5-cycles

作　　者：陈宏宇 潘利娜 CHEN Hongyu;PAN Lina(School of Science,Shanghai Institute of Technology,Shanghai 201418,China)

机构地区：[1]上海应用技术大学理学院,上海201418

出　　处：《上海师范大学学报(自然科学版中英文)》2024年第6期725-729,共5页Journal of Shanghai Normal University(Natural Sciences)

摘　　要：图G的一个点染色称为单射染色,如果任何两个有公共邻点的顶点都染不同的颜色。xi(G)表示图G的单射染色数.设G为围长至少为5且不含相交5-圈的平面图,本文证明了若最大度△(G)≥9,则x_(i)(G)≤△+4.An injective coloring is a vertex coloring such that any two vertices sharing a common neighbor receive distinct colors.Let x(G)be the injective chromatic number of a graph G.If G is a planar graph with girth at least 5 and without intersecting 5-circles,then x_(i)(G)≤△+4 if△(G)≥9.

关 键 词：单射染色 最大度 平面图 圈 围长 

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