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 条
  • [21] A note on adjacent vertex distinguishing edge coloring of graphs
    Jia, Xiuqing
    Wen, Fei
    Li, Zepeng
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025,
  • [22] PROGRESS ON THE ADJACENT VERTEX DISTINGUISHING EDGE COLORING CONJECTURE
    Joret, Gwenael
    Lochet, William
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2221 - 2238
  • [23] A new vertex-distinguishing edge coloring algorithm based on objective function
    Wang, Bimei
    Li, Jingwen
    Wen, Fei
    PROCEEDINGS OF 2020 IEEE 5TH INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC 2020), 2020, : 1182 - 1186
  • [24] On the vertex-distinguishing proper edge coloring of composition of complete graph and star
    Yang, Fang
    Chen, Xiang-en
    Ma, Chunyan
    INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 217 - 221
  • [25] A Vizing-like theorem for union vertex-distinguishing edge coloring
    Bousquet, Nicolas
    Dailly, Antoine
    Duchene, Eric
    Kheddouci, Hamamache
    Parreau, Aline
    DISCRETE APPLIED MATHEMATICS, 2017, 232 : 88 - 98
  • [26] The (adjacent) vertex-distinguishing total coloring of the Mycielski graphs and the Cartesian product graphs
    Sun, Yanli
    Sung, Lei
    DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 200 - +
  • [27] D(β)-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu
    College of Mathematics and Information Science
    College of Information and Electrical Engineering
    Science in China(Series A:Mathematics), 2006, (10) : 1430 - 1440
  • [28] D(β)-vertex-distinguishing total coloring of graphs
    Zhang Zhongfu
    Li Jingwen
    Chen Xiang'en
    Yao Bing
    Wang Wenjie
    Qiu Pengxiang
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2006, 49 (10): : 1430 - 1440
  • [29] General Vertex-Distinguishing Total Coloring of Graphs
    Liu, Chanjuan
    Zhu, Enqiang
    JOURNAL OF APPLIED MATHEMATICS, 2014,
  • [30] D(β)-vertex-distinguishing total coloring of graphs
    Zhongfu Zhang
    Jingwen Li
    Xiang’en Chen
    Bing Yao
    Wenjie Wang
    Pengxiang Qiu
    Science in China Series A: Mathematics, 2006, 49 : 1430 - 1440
12345