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 条
  • [31] The adjacent vertex distinguishing total coloring of planar graphs
    Wang, Weifan
    Huang, Danjun
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (02) : 379 - 396
  • [32] On adjacent-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu CHEN Xiangen LI Jingwen YAO Bing LU Xinzhong WANG Jianfang College of Mathematics and Information Science Northwest Normal University Lanzhou China
    Department of Computer Lanzhou Normal College Lanzhou China
    Institute of Applied Mathematics Lanzhou Jiaotong University Lanzhou China
    College of Information and Electrical Engineering Lanzhou Jiaotong University Lanzhou China
    Institute of Applied Mathematics Chinese Academy of Sciences Beijing China
    [J]. Science in China,Ser.A., 2005, Ser.A.2005 (03) - 299
  • [33] Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints
    Yang, Chao
    Ren, Han
    Yao, Bing
    [J]. ARS COMBINATORIA, 2016, 127 : 197 - 208
  • [34] On the equitable total chromatic number of cubic graphs
    Dantas, S.
    de Figueiredo, C. M. H.
    Mazzuoccolo, G.
    Preissmann, M.
    dos Santos, V. F.
    Sasaki, D.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 209 : 84 - 91
  • [35] Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes
    Chen, Meirun
    Zhai, Shaohui
    [J]. ARS COMBINATORIA, 2014, 114 : 87 - 96
  • [36] Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
    Chen, Meirun
    Guo, Xiaofeng
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (12) : 599 - 602
  • [37] On the vertex face total chromatic number of planar graphs
    Wang, WF
    Liu, JZ
    [J]. JOURNAL OF GRAPH THEORY, 1996, 22 (01) : 29 - 37
  • [38] The Smarandachely Adjacent Vertex Distinguishing E-total Coloring of Some Join Graphs
    Li, Muchun
    Wang, Shuangli
    Wang, Lili
    [J]. SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS II, PTS 1 AND 2, 2014, 475-476 : 379 - 382
  • [39] Vertex Distinguishing Equitable Total Chromatic Number of Join Graph
    Zhi-wen Wang~(1
    [J]. Acta Mathematicae Applicatae Sinica, 2007, (03) : 433 - 438
  • [40] Vertex distinguishing equitable total chromatic number of join graph
    Wang, Zhi-wen
    Yan, Li-hong
    Zhang, Zhong-fu
    [J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2007, 23 (03): : 433 - 438
12345