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

被引:0
|
作者
LI Guang-rong
机构
关键词
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 条
  • [31] The total game chromatic number of paths, cycles and stars
    Bharadwaj, Harish
    Mangam, Tabitha Agnes
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2022, (47): : 303 - 311
  • [32] The determination of the total chromatic number of series-parallel graphs with (G) ≥ 4
    Wang, SD
    Pang, SC
    GRAPHS AND COMBINATORICS, 2005, 21 (04) : 531 - 540
  • [33] The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4
    Shu-Dong Wang
    Shan-Chen Pang
    Graphs and Combinatorics, 2005, 21 : 531 - 540
  • [34] Semi-total graph colourings, the beta parameter, and total chromatic number
    Williams, Jini
    Holroyd, Fred
    DISCRETE MATHEMATICS, 2008, 308 (5-6) : 940 - 954
  • [35] Total chromatic number of graphs of odd order and high degree
    Chew, KH
    DISCRETE MATHEMATICS, 1999, 205 (1-3) : 39 - 46
  • [36] On the total chromatic number of the direct product of cycles and complete graphs
    Castonguay, Diane
    de Figueiredo, Celina M. H.
    Kowada, Luis A. B.
    Patrao, Caroline S. R.
    Sasaki, Diana
    Valencia-Pabon, Mario
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (02) : 1609 - 1632
  • [37] Total Chromatic Number for Certain Classes of Lexicographic Product Graphs
    Sandhiya, T. P.
    Geetha, J.
    Somasundaram, K.
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (02) : 233 - 240
  • [38] On Some Total Chromatic Number ofOuterplanar Graphs with △(G) =6
    Zhang Zhongfu
    Lu Xinzhong
    Han Jincang
    Lin Kerong(Lanzhou Railway Institute
    应用数学, 1996, (04) : 529 - 529
  • [39] Equitable total coloring of Cm □ Cn
    Tong Chunling
    Lin Xiaohui
    Yang Yuansheng
    Li Zhihe
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 596 - 601
  • [40] The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency
    Aseem Dalal
    C. A. Rodger
    Graphs and Combinatorics, 2015, 31 : 2159 - 2173