Chromatic numbers in some graphs
Adel P. Kazemi · International Mathematical Forum · 2007
Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f: V (G) → T, where | T | = k and it is proper if the adjacent vertices have different labels. A graph is k-colorable if it has a proper k-coloring. The chromatic number χ(G) is the least k such that G is k-colorable. Here we study chromatic numbers in some kinds of Harary graphs.