On the total chromatic number of the direct product of cycles and complete graphs
D Castonguay, CMH de Figueiredo… - RAIRO-Operations …, 2024 - rairo-ro.org
A k-total coloring of a graph G is an assignment of k colors to the elements (vertices and
edges) of G so that adjacent or incident elements have different colors. The total chromatic …
edges) of G so that adjacent or incident elements have different colors. The total chromatic …
Total chromatic number for certain classes of product graphs
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 …
that the adjacent and the incident elements receive different colors. The minimum number of …