On the D(2)-Vertex Distinguishing Total Coloring of Graphs with Δ=3

被引：0
|
作者：
Wen, Fei [1 ]
Jia, Xiuqing [1 ]
Li, Zepeng [2 ]
Li, Muchun [1 ]
机构：
[1] Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou 730070, Peoples R China
[2] Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Peoples R China
来源：
MATHEMATICAL NOTES | 2022年 / 112卷 / 1-2期
关键词：
total coloring; D(2)-vertex-distinguishing total coloring; D(2)-vertex-distinguishing total chromatic number; TOTAL CHROMATIC NUMBER;
D O I：
10.1134/S000143462207015X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A D(2)-vertex-distinguishing total coloring of a graph G is a proper total coloring such that no pair of vertices, within distance two, has the same set of colors, and the minimum number of colors required for such a coloring is called D(2)-vertex-distinguishing total chromatic number of G, and denoted by chi(2vt)(G). In this paper, we prove that chi(2vt)(G)<= 11 for any graph G with Delta(G)=3.
引用
收藏
页码：142 / 149
页数：8
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] Vertex-distinguishing total coloring of graphs
    Zhang, Zhongfu
    Qiu, Pengxiang
    Xu, Baogen
    Li, Jingwen
    Chen, Xiangen
    Yao, Bing
    ARS COMBINATORIA, 2008, 87 : 33 - 45
  • [5] On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3
    Chen, Xiang'en
    DISCRETE MATHEMATICS, 2008, 308 (17) : 4003 - 4007
  • [6] Vertex Distinguishing Total Coloring of Ladder Graphs
    Bao, Shitang
    Wang, Zhiwen
    Wen, Fei
    INFORMATION AND AUTOMATION, 2011, 86 : 118 - +
  • [7] The adjacent vertex distinguishing total coloring of planar graphs
    Weifan Wang
    Danjun Huang
    Journal of Combinatorial Optimization, 2014, 27 : 379 - 396
  • [8] On adjacent-vertex-distinguishing total coloring of graphs
    Zhongfu Zhang
    Xiang’en Chen
    Jingwen Li
    Bing Yao
    Xinzhong Lu
    Jianfang Wang
    Science in China Series A: Mathematics, 2005, 48 : 289 - 299
  • [9] General Vertex-Distinguishing Total Coloring of Graphs
    Liu, Chanjuan
    Zhu, Enqiang
    JOURNAL OF APPLIED MATHEMATICS, 2014,
  • [10] Adjacent vertex distinguishing total coloring in split graphs
    Verma, Shaily
    Fu, Hung-Lin
    Panda, B. S.
    DISCRETE MATHEMATICS, 2022, 345 (11)
12345