An Algorithm to determine the chromatic number of a graph
Author & Affiliation:
Shantharaju C. V. (shnthraju@yahoo.co.in)
Department of REVA Institute of Technology, & Management , Kattigenahalli, Yelahanka, Bangalore- 560 064 (INDIA)
Veena Mathad (veena_mathod@rediffmail.com)
Department of Studies in Mathematics Mansagangotri, University of Mysore, Mysore -570006 (INDIA)
Keyword:
u00a0Chromatic number, color class
Issue Date:
August 2009
Abstract:
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.
Pages:
577-579
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
S. C. V.; V. Mathad, "An Algorithm to determine the chromatic number of a graph ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 577-579, 2018Copy the following to cite this URL:
S. C. V.; V. Mathad, "An Algorithm to determine the chromatic number of a graph ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 577-579, 2018Available from: https://www.ultrascientist.org/paper/1226/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
