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.
Birincil Dil | İngilizce |
---|---|
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 1 Aralık 2017 |
Yayımlandığı Sayı | Yıl 2017 Cilt: 7 Sayı: 2 |