Graph Coloring and Its Applications

Graph coloring is an important topic in graph theory. In graph coloring we have assign colors to certain elements of the graph along with certain constraints. Suppose we are given ‘n’ colors, then we have to color the vertices in such a way that no two adjacent vertices of the graph have the same color; this is known as vertex coloring. Similarly we have edge coloring and face coloring. The coloring problem has a huge number of applications in modern computer science such as making schedule of time table, sudoku, bipartite graphs, map coloring, data mining, networking, final exam timetabling, aircraft scheduling, guarding an art gallery. In this paper we are going to focus on face coloring.