General Vertex-Distinguishing Total Coloring of Graphs

被引：2
|
作者：
Liu, Chanjuan [1 ]
Zhu, Enqiang [1 ]
机构：
[1] Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China
来源：
JOURNAL OF APPLIED MATHEMATICS | 2014年
基金：
中国国家自然科学基金;
关键词：
TOTAL CHROMATIC-NUMBERS; EDGE; AVDTC;
D O I：
10.1155/2014/849748
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.
引用
收藏
页数：7
相关论文
共 50 条
  • [1] Vertex-distinguishing total coloring of graphs
    Zhang, Zhongfu
    Qiu, Pengxiang
    Xu, Baogen
    Li, Jingwen
    Chen, Xiangen
    Yao, Bing
    ARS COMBINATORIA, 2008, 87 : 33 - 45
  • [2] General vertex-distinguishing total coloring of complete bipartite graphs
    Yang, Hong
    ARS COMBINATORIA, 2016, 125 : 371 - 379
  • [3] 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
  • [4] 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
  • [5] 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
  • [6] Incidence adjacent vertex-distinguishing total coloring of graphs
    Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
    不详
    Proc. - Int. Conf. Comput. Intell. Softw. Eng., CiSE, 1600,
  • [7] 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
  • [8] 2-distance vertex-distinguishing total coloring of graphs
    Hu, Yafang
    Wang, Weifan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (02)
  • [9] 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 - +
  • [10] TWO-DISTANCE VERTEX-DISTINGUISHING TOTAL COLORING OF SUBCUBIC GRAPHS
    He, Zhengyue
    Liang, Li
    Gao, Wei
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2023, 24 (02): : 113 - 120
12345