Upper bounds for adjacent vertex-distinguishing edge coloring

被引：2
|
作者：
Zhu, Junlei [1 ,2 ]
Bu, Yuehua [1 ,3 ]
Dai, Yun [1 ]
机构：
[1] Zhejiang Normal Univ, Coll Math Phys & Informat Engn, Jinhua 321004, Peoples R China
[2] Jiaxing Univ, Coll Math Phys & Informat Engn, Jiaxing 314001, Peoples R China
[3] Zhejiang Normal Univ, Xingzhi Coll, Jinhua 321004, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2018年 / 35卷 / 02期
关键词：
Proper edge coloring; Adjacent vertex-distinguishing edge coloring; Lovasz local lemma; NEIGHBOR-DISTINGUISHING INDEX; PLANAR GRAPHS; SUM;
D O I：
10.1007/s10878-017-0187-0
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
An adjacent vertex-distinguishing edge coloring of a graph is a proper edge coloring such that no pair of adjacent vertices meets the same set of colors. The adjacent vertex-distinguishing edge chromatic number is the minimum number of colors required for an adjacent vertex-distinguishing edge coloring, denoted as . In this paper, we prove that for a connected graph G with maximum degree , , which proves the previous upper bound. We also prove that for a graph G with maximum degree and minimum degree , .
引用
收藏
页码：454 / 462
页数：9
相关论文
共 50 条
  • [41] Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs
    Liu Xin-sheng
    Zhu Zhi-qiang
    ARS COMBINATORIA, 2015, 119 : 403 - 411
  • [42] Adjacent vertex distinguishing edge coloring of IC-planar graphs
    Zhuoya Liu
    Changqing Xu
    Journal of Combinatorial Optimization, 2022, 43 : 710 - 726
  • [43] Gap vertex-distinguishing edge colorings of graphs
    Tahraoui, M. A.
    Duchene, E.
    Kheddouci, H.
    DISCRETE MATHEMATICS, 2012, 312 (20) : 3011 - 3025
  • [44] Concise proofs for adjacent vertex-distinguishing total colorings
    Hulgan, Jonathan
    DISCRETE MATHEMATICS, 2009, 309 (08) : 2548 - 2550
  • [45] Vertex-distinguishing proper edge-colorings
    Burris, AC
    Schelp, RH
    JOURNAL OF GRAPH THEORY, 1997, 26 (02) : 73 - 82
  • [46] Vertex-distinguishing edge colorings of random graphs
    Balister, PN
    RANDOM STRUCTURES & ALGORITHMS, 2002, 20 (01) : 89 - 97
  • [47] Adjacent vertex-distinguishing edge colorings of K4-minor free graphs
    Wang, Weifan
    Wang, Yiqiao
    APPLIED MATHEMATICS LETTERS, 2011, 24 (12) : 2034 - 2037
  • [48] Adjacent vertex-distinguishing E-total coloring on the multiple join graph of complete graph and wheel
    Li, Muchun
    Zhang, Li
    SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS, PTS 1-4, 2013, 303-306 : 1605 - 1608
  • [49] UPPER BOUNDS FOR THE D(β)-VERTEX-DISTINGUISHING EI-TOTAL CHROMATIC NUMBERS OF GRAPHS
    Liu, Xinsheng
    Wang, Zhiqiang
    2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 2, 2012, : 265 - 269
  • [50] General vertex-distinguishing total coloring of complete bipartite graphs
    Yang, Hong
    ARS COMBINATORIA, 2016, 125 : 371 - 379
12345