| 围长至少为4的平面图的邻点可区别边色数 |
| |
| 引用本文： | 严丞超,黄丹君,王维凡.围长至少为4的平面图的邻点可区别边色数[J].数学研究,2012(4):331-341. |
| |
| 作者姓名： | 严丞超 黄丹君 王维凡 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院 |
| |
| 基金项目： | supported by the Scientific Research Fund of Zhejiang Provincial Education Department(Y201226078);The third author was supported partially by NSFC(11071223);ZJNSF(Z6090150) |
| |
| 摘 要： | 图G的邻点可区别边染色是G的正常边染色，使得每一对相邻顶点有不同的颜色集合．G的邻点可区别边色数X＇a（G）是使得G有一个k-邻点可区别边染色的最小正整数七．本文证明了：若G是围长至少为4且最大度至少为6的平面图，则X＇a（G）≤△＋2．
|
| 关 键 词： | 邻点可区别边染色 平面图 最大度 围长 |
Adjacent Vertex Distinguishing Edge-colorings of Planar Graphs with Girth at Least Four |
| |
| Yan Chengchao Huang Danjun Wang Weifan.Adjacent Vertex Distinguishing Edge-colorings of Planar Graphs with Girth at Least Four[J].Journal of Mathematical Study,2012(4):331-341. |
| |
| Authors: | Yan Chengchao Huang Danjun Wang Weifan |
| |
| Institution: | Yan Chengchao Huang Danjun Wang Weifan (College of Mathematics,Physics and Information Engineering, Zhejiang Normal University,Jinhua Zhejiang 321004) |
| |
| Abstract: | An adjacent vertex distinguishing edge-colorings of graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by x＇a（G）. In this paper, we prove that： if G is a planar graph with girth at least 4 and maximum degree at least 6, then x＇a（ G） △ ＋ 2. |
| |
| Keywords: | Adjacent vertex distinguishing edge-coloring Planar graph Maximum degree Girth |
| 本文献已被 CNKI 维普 等数据库收录！ |
