Graph Coloring Based on Prim's and Kruskal's Strategies
Author & Affiliation:
U.S. RAJPUT (usrajput@sify.com)
Department of Mathematics & Astromomy, Lucknow, University, Lucknow - 226007 (INDIA)
Nirmal Srivastava (nirmalsri25@gmail.com)
Department of Mathematics & Astromomy, Lucknow, University, Lucknow - 226007 (INDIA)
Keyword:
Vertex coloring, Chromatic number
Issue Date:
April 2010
Abstract:
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 algorithms1-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.
Pages:
353-355
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
U. Rajput; N. Srivastava, "Graph Coloring Based on Prim's and Kruskal's Strategies", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 353-355, 2018Copy the following to cite this URL:
U. Rajput; N. Srivastava, "Graph Coloring Based on Prim's and Kruskal's Strategies", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 353-355, 2018Available from: https://www.ultrascientist.org/paper/1064/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
