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 条
  • [31] OPTIMAL ADJACENT VERTEX-DISTINGUISHING EDGE-COLORINGS OF CIRCULANT GRAPHS
    Gravier, Sylvain
    Signargout, Hippolyte
    Slimani, Souad
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (04) : 1341 - 1359
  • [32] L-Factors and Adjacent Vertex-Distinguishing Edge-Weighting
    Duan, Yinghua
    Lu, Hongliang
    Yu, Qinglin
    EAST ASIAN JOURNAL ON APPLIED MATHEMATICS, 2012, 2 (02) : 83 - 93
  • [33] The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
    Li, Jingwen
    Hu, Tengyun
    Wen, Fei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
  • [34] Smarandachely Adjacent Vertex Distinguishing Edge Coloring of Some Graphs
    Liu, Shunqin
    2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [35] Union vertex-distinguishing edge colorings
    Kittipassorn, Teeradej
    Sanyatit, Preechaya
    DISCRETE MATHEMATICS, 2024, 347 (09)
  • [36] Vertex-distinguishing edge colorings of graphs
    Ballister, PN
    Riordan, OM
    Schelp, RH
    JOURNAL OF GRAPH THEORY, 2003, 42 (02) : 95 - 109
  • [37] Vertex-distinguishing total coloring of mC5
    Chen, Xiang'en
    Ma, Yanrong
    Yang, Fang
    Ma, Chunyan
    Yao, Bing
    MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4, 2013, 321-324 : 578 - 581
  • [38] Algorithm for the Vertex-Distinguishing Total Coloring of Complete Graph
    Li Jingwen
    Xu Xiaoqing
    Yan Guanghui
    PROCEEDINGS OF THE 2011 2ND INTERNATIONAL CONGRESS ON COMPUTER APPLICATIONS AND COMPUTATIONAL SCIENCE, VOL 2, 2012, 145 : 273 - 278
  • [39] A note on the vertex-distinguishing proper total coloring of graphs
    Li, Jingwen
    Wang, Zhiwen
    Zhang, Zhongfu
    Zhu, Enqiang
    Wan, Fei
    Wang, Hongjie
    ARS COMBINATORIA, 2010, 96 : 421 - 423
  • [40] Adjacent vertex distinguishing edge coloring of IC-planar graphs
    Liu, Zhuoya
    Xu, Changqing
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (04) : 710 - 726
12345