Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ

被引：40
|
作者：
Hocquard, Herve [1 ]
Montassier, Mickael [1 ]
机构：
[1] Univ Bordeaux 1, LaBRI, F-33405 Talence, France
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2013年 / 26卷 / 01期
关键词：
Adjacent vertex-distinguishing edge coloring; Maximum average degree; OBSERVABILITY;
D O I：
10.1007/s10878-011-9444-9
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let and Delta(G) denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every graph G with Delta(G)a parts per thousand yen5 and can be avd-colored with Delta(G)+1 colors. This completes a result of Wang and Wang (J. Comb. Optim. 19:471-485, 2010).
引用
收藏
页码：152 / 160
页数：9
相关论文
共 50 条
  • [21] Novel Algorithm For Adjacent Vertex-Distinguishing Edge Coloring Of Large-Scale Random Graphs
    Huanping, Zhao
    Peijin, Zhu
    Jingwen, Li
    Huojie, Shi
    [J]. Journal of Engineering Science and Technology Review, 2021, 14 (03) : 69 - 75
  • [22] A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
    Bazgan, C
    Harkat-Benhamdine, A
    Li, H
    Wozniak, M
    [J]. DISCRETE MATHEMATICS, 2001, 236 (1-3) : 37 - 42
  • [23] Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions
    Liu, Bin
    Liu, Guizhen
    [J]. GRAPHS AND COMBINATORICS, 2010, 26 (06) : 781 - 791
  • [24] Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions
    Bin Liu
    Guizhen Liu
    [J]. Graphs and Combinatorics, 2010, 26 : 781 - 791
  • [25] D(β)-vertex-distinguishing total coloring of graphs
    Zhang Zhongfu
    Li Jingwen
    Chen Xiang'en
    Yao Bing
    Wang Wenjie
    Qiu Pengxiang
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS, 2006, 49 (10): : 1430 - 1440
  • [26] D(β)-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu
    College of Mathematics and Information Science
    College of Information and Electrical Engineering
    [J]. Science China Mathematics, 2006, (10) : 1430 - 1440
  • [27] General Vertex-Distinguishing Total Coloring of Graphs
    Liu, Chanjuan
    Zhu, Enqiang
    [J]. JOURNAL OF APPLIED MATHEMATICS, 2014,
  • [28] D(β)-vertex-distinguishing total coloring of graphs
    Zhongfu Zhang
    Jingwen Li
    Xiang’en Chen
    Bing Yao
    Wenjie Wang
    Pengxiang Qiu
    [J]. Science in China Series A: Mathematics, 2006, 49 : 1430 - 1440
  • [29] The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
    Li, Jingwen
    Hu, Tengyun
    Wen, Fei
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
  • [30] Smarandachely Adjacent Vertex Distinguishing Edge Coloring of Some Graphs
    Liu, Shunqin
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
12345