# Graph Theory Coloring Number

**This video discusses the concept of graph coloring as well as the chromatic number.**

**Graph theory coloring number**. The minimum number of colors required for vertex coloring of graph g is called as the chromatic number of g denoted by x g. If g is not a null graph then χ g 2. If is odd then the last vertex would have the same color as the first vertex so the chromatic number will be 3. Chromatic number of a graph is the minimum number of colors required to properly color the graph.

Graph coloring in graph theory graph coloring is a process of assigning colors to the vertices such that no two adjacent vertices get the same color. A graph coloring for a graph with 6 vertices. It is impossible to color the graph with 2 colors so the graph has chromatic number 3. This is called a vertex coloring.

It is an assignment of labels traditionally called colors to elements of a graph subject to certain constraints. You can also connect with us at. A graph coloring is an assignment of labels called colors to the vertices of a graph such that no two adjacent vertices share the same color. Graph coloring chromatic number with solved examples graph theory classes in hindi graph theory video lectures in hindi for b tech m tech mca students.

Solution if the vertex are colored in an alternating fashion the cycle graph requires 2 colors. In its simplest form it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color.