Konu "Splitting graph" için JAEM 2017, Vol 7, No 2 listeleme
Toplam kayıt 1, listelenen: 1-1
-
Some results on total chromatic number of a graph
(Işık University Press, 2017-08-24)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 ...