A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Some Cubic Graphs

被引：0
|
作者：
Chen, Qin [1 ]
机构：
[1] China Jiliang Univ, Coll Sci, Hangzhou 310018, Peoples R China
来源：
ARS COMBINATORIA | 2016年 / 124卷
关键词：
Adjacent vertex distinguishing total coloring; Flower snark; Goldberg snark; Cubic Halin graph; FAMILIES;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that no two adjacent vertices are incident to the same set of colors. The minimum number of colors needed for such a coloring is denoted by chi(at)(G). In this note, we prove that chi(at)(G) = 5 for some cubic graphs.
引用
收藏
页码：319 / 327
页数：9
相关论文
共 50 条
  • [1] A note on the adjacent vertex distinguishing total chromatic number of graphs
    Huang, Danjun
    Wang, Weifan
    Yan, Chengchao
    [J]. DISCRETE MATHEMATICS, 2012, 312 (24) : 3544 - 3546
  • [2] On the Adjacent Vertex Strong Distinguishing Total chromatic number of Some Graphs
    Yan, Qiantai.
    Li, Wuzhuang.
    [J]. 2013 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA), 2013, : 391 - 394
  • [3] The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs
    Wang, Zhiwen
    Zhu, Enqiang
    [J]. 2010 4TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING (ICBBE 2010), 2010,
  • [4] The adjacent vertex distinguishing total chromatic number of graphs
    Wang, Zhiwen
    Zhu, Enqiang
    [J]. 2010 4th International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2010, 2010,
  • [5] A note on the adjacent vertex distinguishing total chromatic number of graph
    Wang, Zhiwen
    [J]. ADVANCED MATERIALS AND COMPUTER SCIENCE, PTS 1-3, 2011, 474-476 : 2341 - 2345
  • [6] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    [J]. Hu, Xiaolan (xlhu@mail.ccnu.edu.cn), 2017, Elsevier B.V., Netherlands (233)
  • [7] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    Hu, Xiaolan
    Zhang, Yunqing
    Miao, Zhengke
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 29 - 32
  • [8] The adjacent vertex distinguishing total chromatic number
    Coker, Tom
    Johannson, Karen
    [J]. DISCRETE MATHEMATICS, 2012, 312 (17) : 2741 - 2750
  • [9] On the adjacent vertex distinguishing edge chromatic number of graphs
    Wang, Zhiwen
    [J]. ARS COMBINATORIA, 2016, 124 : 379 - 388
  • [10] The Adjacent Vertex Distinguishing Total Chromatic Number of Some Families of Snarks
    Chen, Qin
    [J]. ARS COMBINATORIA, 2017, 132 : 311 - 321
12345