《山东大学学报(理学版)》 ›› 2023, Vol. 58 ›› Issue (12): 134-139.doi: 10.6040/j.issn.1671-9352.0.2022.276
李锦(
),徐常青*()
Jin LI(),Changqing XU*()
摘要：
设φ为图G的l-正常边染色, Cφ(u)为G中所有与顶点u关联的边所染颜色的集合。如果对G的任意边uv, 都有Cφ(u)与Cφ(v)不同, 则称染色φ为G的l-邻点可区别边染色, 简记为l-avd染色。使图G有l-avd染色的最小正整数l称为图G的邻点可区别边色数, 记为χ′a(G)。本文通过权转移方法研究不含相交三角形IC-正常可平面图G的邻点可区别边染色, 得到χ′a(G)≤max{Δ(G)+2, 12}。
中图分类号:
| 1 | BONDY J A , MURTY U S R . Graph theory with applications[M]. New York: North-Holland, 2008. |
| 2 |
ZHANG Zhongfu , LIU Linzhong , WANG Jianfang . Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15 (5): 623- 626.
doi: 10.1016/S0893-9659(02)80015-5 |
| 3 |
HORŇÁK M , HUANG Danjun , WANG Weifan . On neighbor-distinguishing index of planar graphs[J]. Journal of Graph Theory, 2014, 76 (4): 262- 278.
doi: 10.1002/jgt.21764 |
| 4 | BONAMY M, BOUSQUET N, HOCQUARD H. Adjacent vertex-distinguishing edge coloring of graphs[C]//The Seventh European Conference on Combinatorics, Graph Theory and Applications, 2013, 16: 313-318. |
| 5 | 严丞超, 黄丹君, 王维凡. 围长至少为4的可平面图的邻点可区别边染色[J]. 数学研究, 2012, 45 (4): 331- 341. |
| 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, 45 (4): 331- 341. | |
| 6 |
HUANG Danjun , MIAO Zhengke , WANG Weifan . Adjacent vertex distinguishing indices of planar graphs without 3-cycles[J]. Discrete Mathematics, 2015, 338 (3): 139- 148.
doi: 10.1016/j.disc.2014.10.010 |
| 7 |
HUANG Danjun , ZHANG Xiaoxiu , WANG Weifan , et al. Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles[J]. Discrete Mathematics, Algorithms and Applications, 2020, 12 (4): 2050035.
doi: 10.1142/S1793830920500354 |
| 8 | 刘卓雅, 徐常青. 无相交三角形平面图的邻点可区别边染色[J]. 山东大学学报(理学版), 2020, 55 (9): 36- 41. |
| LIU Zhuoya , XU Changqing . Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles[J]. Journal of Shandong University (Natural Science), 2020, 55 (9): 36- 41. | |
| 9 |
LIU Zhuoya , XU Changqing . Adjacent vertex distinguishing edge coloring of IC-planar graphs[J]. Journal of Combinatorial Optimization, 2022, 43 (4): 710- 726.
doi: 10.1007/s10878-021-00807-0 |
| 10 | 宋超, 徐常青. 不含三角形的IC-可平面图的邻点可区别边染色[J]. 数学进展, 2022, 51 (5): 817- 822. |
| SONG Chao , XU Changqing . Adjacent vertex distinguishing edge colorings of triangle free IC-planar graphs[J]. Advances in Mathematics (China), 2022, 51 (5): 817- 822. |
| [1] | 吴弦禧,黄丹君. mad(G)≤(13)/4的图的均匀染色[J]. 《山东大学学报(理学版)》, 2025, 60(2): 41-50. |
| [2] | 刘卓雅,徐常青. 无相交三角形平面图的邻点可区别边染色[J]. 《山东大学学报(理学版)》, 2020, 55(9): 36-41. |
| [3] | 何雪, 田双亮. 若干图的倍图的邻点可区别边(全)染色[J]. 山东大学学报（理学版）, 2015, 50(04): 63-66. |
|
||
