| Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs with Girth at Least 5北大核心CSCD |
| |
| 引用本文： | 张小秀,黄丹君.Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs with Girth at Least 5北大核心CSCD[J].数学学报,2022(2):325-334. |
| |
| 作者姓名： | 张小秀 黄丹君 |
| |
| 作者单位： | 1. 浙江师范大学数学与计算机科学学院;2. 杭州市余杭区运河中学 |
| |
| 基金项目： | 国家自然科学基金资助项目(11971437)；;浙江省自然科学基金资助项目(LY18A010014)； |
| |
| 摘 要： | An adjacent vertex distinguishing edge-colorings of a graph G is a proper edge coloring of G such that any pair of adjacent vertices have distinct sets of colors. The minimum number of color required for an adjacent vertex distinguishing edge-coloring of G is denoted by χa'(G). In this paper, we prove that if G is a planar graph with girth at least 5 and without isolated edges, then χa'(G)≤ max{8,Δ(G)+1}. © 2022, Chinese Academy of Sciences. All right reserved.
|
| 关 键 词： | 邻点可区别边染色 平面图 围长 最大度 |
| 本文献已被 维普 等数据库收录！ |
|
