Graph Coloring and its Real Time Applications an Overview

Abstract

Graph coloring is one of the most important concepts in graph theory and it has huge number of applications in daily life. Various coloring methods are available and can be used on requirement basis. The proper coloring of a graph G is the coloring of the vertices and edges with minimal number of colors such that no two vertices should have the same color. The minimum number of color is called the chromatic number $\chi(G)$ and the graph G is called properly colored graph. This paper presents the applications of graph coloring and its importance in various fields.