Total colorings of some classes of four regular circulant graphs

被引：3

作者：

Navaneeth, R. ^{[1
]}

Geetha, J. ^{[1
]}

Somasundaram, K. ^{[1
]}

Fu, Hung-Lin ^{[2
]}

机构：

[1] Amrita Vishwa Vidyapeetham, Amrita Sch Engn Coimbatore, Dept Math, Coimbatore, Tamil Nadu, India

[2] Natl Yang Ming Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2024年 / 21卷 / 01期

关键词：

Total coloring; circulant graphs;

D O I：

10.1080/09728600.2022.2088316

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The total chromatic number, chi '' (G) is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, chi '' (G) <= Delta(G) + 2, where Delta(G) represents the maximum degree of G. In this paper we obtained the total chromatic number for some classes of four regular circulant graphs.

引用

页码：1 / 3

页数：3