摘要: |
图G的一个点染色称为单射染色,如果任何两个有公共邻点的顶点都染不同的颜色. χi(G)表示图G的单射染色数.设G为围长至少为5且不含相交5-圈的平面图,本文证明了若最大度Δ(G)≥9 ,则χi(G)≤Δ+4 . |
关键词: 单射染色 最大度 平面图 圈 围长 |
DOI:10.20192/j.cnki.JSHNU(NS).2024.06.003 |
分类号:O157.5 |
基金项目: |
|
Injective coloring of planar graphs without intersecting 5-cycles |
CHEN Hongyu, PAN Lina
|
School of Science, Shanghai Institute of Technology, Shanghai 201418, China
|
Abstract: |
An injective coloring is a vertex coloring such that any two vertices sharing a common neighbor receive distinct colors. Let χi (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 χi (G)≤ Δ + 4 if Δ(G)≥ 9. |
Key words: injective coloring maximum degree planar graph cycle girth |