On Local Coloring of Graphs
Baogen Xu · Journal of East China Jiaotong University · 2007
G.Chartrand [1] introduced the concept of local coloring in graphs.In this paper we give some bounds for local chromatic number of a graph G,prove that x1(G)+x1(■)≤2n-1 holds for any graph G of order n,and determine the local chromatic numbers of complete graphs and cycles.