Algorithm on Vertex Coloring

Authors

  • G. Anitha  PG Student, Department of Mathematics, Dr. SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamilnadu, India
  • P. Murugan  Assistant Professor, Department of Mathematics, Dr. SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamilnadu, India

DOI:

https://doi.org//10.32628/18410IJSRSET

Keywords:

Vertex Coloring, Edge Coloring, Face Coloring, Map Coloring

Abstract

Graph theory is the study of graphs,which are mathematical structures used to model pairwise relations between objects. In our work we have used welsh powell algorithm on vertex coloring, in this paper we formulated the welsh-powell algorithm,it provide a greedy algorithm that runs on a static graph,this is an iterative greedy algorithm.

References

  1. Murat Ashan & Nurdan Akshan Baykan- A Perfomance comparision of Graph Coloring Algotithmn, International Journal of Intelligent systems and Applications in Engineering, September 2016 3 ISSN:2147-6799
  2. D .B. West Introduction to Graph Theory,Prentice Hall ,U.S.A, 588pp, 2001.
  3. D. Brelaz New Methods to Color the Vertices of a Graph,Communications of the ACM 22(4)(1979) 251-256.
  4. H. A. Omari and K.E. Sabri, New Graph Coloring Algorithmn, American Journal Of Mathematics and Statistics 2 (4): 739-741,2006

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-09-30

Issue

Volume 4, Issue 10, September-October-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
G. Anitha, P. Murugan, " Algorithm on Vertex Coloring, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 10, pp.181-184, September-October-2018. Available at doi : https://doi.org/10.32628/18410IJSRSET