eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences August 2009 21 2 577 579 jusps-A 1226 article Shantharaju C. V. (shnthraju@yahoo.co.in) 1 Veena Mathad (veena_mathod@rediffmail.com) 2 Department of REVA Institute of Technology, & Management , Kattigenahalli, Yelahanka, Bangalore- 560 064 (INDIA) Department of Studies in Mathematics Mansagangotri, University of Mysore, Mysore -570006 (INDIA) <p style="text-align: justify;">A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices receive the same color. An n-coloring of a graph G uses n colors. The chromatic number c(G) of a graph G is the minimum n for which G has an n-coloring. In this paper, we give an algorithm to determine the chromatic number of a graph.</p> <p>&nbsp;</p> <p>&nbsp;</p> https://www.ultrascientist.org/paper/1226/ u00a0Chromatic number color class