Total Coloring for some classes of Circulant graphs

06/13/2020
by   Prajnanaswaroopa S, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2020

Total Coloring for some classes of Cayley graphs

The Total coloring conjecture states that any simple graph G with maximu...
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...
research
07/12/2021

Coloring graphs with forbidden bipartite subgraphs

A conjecture of Alon, Krivelevich, and Sudakov states that, for any grap...
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...
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...
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...
research
08/14/2019

Equitable vertex arboricity of d-degenerate graphs

A minimization problem in graph theory so-called the equitable tree-colo...

Please sign up or login with your details

Forgot password? Click here to reset