Volume : 2, Issue : 11, November - 2013

Coloring

Varmora Chetan J. , Dr. Prashant Makwana

Abstract :

The graph coloring problem is to assign colors to vertices of graphs such that no two adjacent vertices receive the same color; such a coloring is referred to as a legal coloring of G. The minimum number of colors required to do a legal coloring is known as the chromatic number of G, and is denoted χ (G). Graph coloring is a fundamental and extensively studied problem.Now we’re going to prove a theorem about chicken tournaments. The result is not very useful, but the proof involves both induction and digraphs.