Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the
Sierpiński graphs S (n, k), graphs S+ (n, k), and graphs S++ (n, k) are considered. In …

A total coloring of a graph is an assignment of colors to all the elements of the graph in such
a way that no two adjacent or incident elements receive the same color. In this paper, we …

A k-total coloring of a graph G is an assignment of k colors to its elements (vertices and
edges) so that adjacent or incident elements have different colors. The total chromatic …

Total Coloring of a graph G is a type of graph coloring in which any two adjacent vertices, an
edge, and its incident vertices or any two adjacent edges do not receive the same color. The …

A total coloring of a finite and simple graph G is an assignment of colors to the elements
(vertices and edges) of G such that neighbored elements (two adjacent vertices or two …

Coloring of the graph products, especially vertex and edge coloring, has been widely
researched for all types of graph products. For total graph coloring, as combination of edge …

This work aims to study the equitable total coloring into subfamilies of regular graphs. For
this purpose, we use some relationships between equitable total coloring and range (vertex) …

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures.
In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of …

Total coloring is a function that assigns colors to the vertices and edges of the graph such
that the adjacent and the incident elements receive different colors. The minimum number of …

A\textit {$ k $-total coloring} of a graph $ G $ is an assignment of $ k $ colors to its elements
(vertices and edges) so that adjacent or incident elements have different colors. The total …