Equitable Total Coloring of Corona of Cubic Graphs

Abstract

The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number, and is denoted by X′=(G).

Keywords

• equitable coloring
• total coloring
• equitable total coloring
• cubic graphs
• 05c15
• 05c76