A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph is the smallest positive integer for which the graph admits a total coloring. In this paper, we derive some results on total chromatic number of a graph.
| Primary Language | English |
|---|---|
| Authors | |
| Publication Date | December 1, 2017 |
| Published in Issue | Year 2017 Volume: 7 Issue: 2 |