Total Chromatic Number of the Join of Km,n and Cn

被引：0
|
作者：
LI Guang-rong
机构：
来源：
数学季刊 | 2006年 / 02期
关键词：
total coloring; total chromatic number; join graphs; cycle; complete bipartite graph;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
The total chromatic number XT(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no adjacent or incident pair of elements receive the same color. G is called Type 1 if XT(G)=Δ(G) + 1. In this paper we prove that the join of a complete bipartite graph Km,n and a cycle Cn is of Type 1.
引用
收藏
页码：264 / 270
页数：7
相关论文
共 50 条
  • [41] Total chromatic number of planar graphs with maximum degree ten
    Wang, Weifan
    JOURNAL OF GRAPH THEORY, 2007, 54 (02) : 91 - 102
  • [42] The total chromatic number of graphs of even order and high degree
    Xie, DZ
    Yang, WL
    DISCRETE MATHEMATICS, 2003, 271 (1-3) : 295 - 302
  • [43] The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency
    Dalal, Aseem
    Rodger, C. A.
    GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2159 - 2173
  • [44] On total chromatic number of planar graphs without 4-cycles
    Ying-qian Wang
    Min-le Shangguan
    Qiao Li
    Science in China Series A: Mathematics, 2007, 50 : 81 - 86
  • [45] On total chromatic number of planar graphs without 4-cycles
    Wang, Ying-qian
    Shangguan, Min-le
    Li, Qiao
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (01): : 81 - 86
  • [46] The total chromatic number of regular graphs of even order and high degree
    Xie, DZ
    He, ZS
    DISCRETE MATHEMATICS, 2005, 300 (1-3) : 196 - 212
  • [47] A note on the total chromatic number of Halin graphs with maximum degree 4
    Zhang, ZF
    Li, LZ
    Wang, JF
    Li, HX
    APPLIED MATHEMATICS LETTERS, 1998, 11 (05) : 23 - 27
  • [48] Local Total Antimagic Chromatic Number for the Disjoint Union of Star Graphs
    Sandhiya, Venkatesan
    Nalliah, Moviri Chettiar
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (04): : 2828 - 2842
  • [49] The total chromatic number of Pseudo-Halin graphs with lower degree
    Meng, Xianyong
    Guo, Hanhua
    Li, Rensuo
    Chen, Tao
    Su, Bentang
    DISCRETE MATHEMATICS, 2009, 309 (04) : 982 - 986
  • [50] On total chromatic number of planar graphs without 4-cycles
    Min-le SHANGGUAN
    ScienceinChina(SeriesA:Mathematics), 2007, (01) : 81 - 86
12345