AI Chat AI Image Generator AI Video Text to Speech

Total Coloring for some classes of Cayley graphs

06/13/2020

∙

by Prajnanaswaroopa S, et al.

∙

∙

The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.

Prajnanaswaroopa S
6 publications
Geetha J
2 publications
Somasundaram K
2 publications

research

∙ 06/13/2020

Total Coloring for some classes of Circulant graphs

The Total coloring conjecture states that any simple graph G with maximu...

0 Prajnanaswaroopa S, et al. ∙

research

∙ 02/24/2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs

An equitable coloring of a graph G is a proper vertex coloring of G such...

0 Janusz Dybizbański, et al. ∙

research

∙ 09/13/2021

Distributed recoloring of interval and chordal graphs

One of the fundamental and most-studied algorithmic problems in distribu...

0 Nicolas Bousquet, et al. ∙

research

∙ 07/12/2021

Coloring graphs with forbidden bipartite subgraphs

A conjecture of Alon, Krivelevich, and Sudakov states that, for any grap...

0 James Anderson, et al. ∙

research

∙ 05/26/2021

Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs

In this paper, we have obtained the total chromatic as well as equitable...

0 S. Prajnanaswaroopa, et al. ∙

research

∙ 03/21/2020

A proof of the Total Coloring Conjecture

A total coloring of a graph G is a map f:V(G) ∪ E(G) →𝒦, where 𝒦 is a se...

0 T Srinivasa Murthy, et al. ∙

research

∙ 10/27/2021

Most direct product of graphs are Type 1

A k-total coloring of a graph G is an assignment of k colors to its elem...

0 Diane Castonguay, et al. ∙