eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences April 2010 22 1 353 355 jusps-A 1064 article U.S. RAJPUT (usrajput@sify.com) 1 Nirmal Srivastava (nirmalsri25@gmail.com) 1 Department of Mathematics & Astromomy, Lucknow, University, Lucknow - 226007 (INDIA) <p style="text-align: justify;">Since the development of graph theory, its applications are gaining a lot of importance among the researchers. Coloring of graphs is one of those applications used for creating maps and networks. Coloring involves use of different colors to print the regions of the graphs. A number of algorithms^1-3 have been developed for coloring the graphs. In this paper we are presenting two algorithms for coloring the vertices and finding the chromatic number of the planer graphs.<br /> &nbsp;</p> https://www.ultrascientist.org/paper/1064/ Vertex coloring Chromatic number