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

共 11 条

[1]

Behzad M., 1965, Graphs and Their Chromatic Numbers

[2]

BORODIN OV, 1989, J REINE ANGEW MATH, V394, P180

[3]

Campos C.N., 2003, TEMA-TEND MAT APL CO, V4, P177

[4] Total colorings of circulant graphs [J].

Geetha, J. ;

Somasundaram, K. ;

Fu, Hung-Lin .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (05)

[5]

Geetha J., TOTAL COLORING SURVE

[6]

Junior M.N.A., 2020, ANAIS ENCONTRO TEORI, VSBC, P81

[7] Total and fractional total colourings of circulant graphs [J].

Khennoufa, Riadh ;

Togni, Olivier .

DISCRETE MATHEMATICS, 2008, 308 (24) :6316-6329

[8]

Prajnanaswaroopa S., TOTAL COLORING SOME

[9] DETERMINING THE TOTAL COLORING NUMBER IS NP-HARD [J].

SANCHEZARROYO, A .

DISCRETE MATHEMATICS, 1989, 78 (03) :315-319

[10]

Vizing V.G., 1968, RUSS MATH SURV, V23, P125, DOI DOI 10.1070/RM1968V023N06ABEH001252

← 1 2 →