In this thesis we study local chromatic number of some graphs and find an upper bound for local chromatic in term of maximum degree of graph. By using of this upper bound we can answer to a conjecture arisen by Chartrand et al. in [2003]. Existence of locally rainbow graphs was an open problem; we present a way to construct this kind of graphs.
