## Chromatic Number of graphs | Graph coloring in Graph theory## Graph coloringGraph coloring can be described as a process of assigning colors to the vertices of a graph. In this, the same color should not be used to fill the two adjacent vertices. We can also call graph coloring as Vertex Coloring. In graph coloring, we have to take care that a graph must not contain any edge whose end vertices are colored by the same color. This type of graph is known as the Properly colored graph.
In this graph, we are showing the properly colored graph, which is described as follows: The above graph contains some points, which are described as follows: - The same color cannot be used to color the two adjacent vertices.
- Hence, we can call it as a properly colored graph.
There are various applications of graph coloring. Some of their important applications are described as follows: - Assignment
- Map coloring
- Scheduling the tasks
- Sudoku
- Prepare time table
- Conflict resolution
## Chromatic NumberThe chromatic number can be described as the minimum number of colors required to properly color any graph. In other words, the chromatic number can be described as a minimum number of colors that are needed to color any graph in such a way that no two adjacent vertices of a graph will be assigned the same color. ## Example of Chromatic number:To understand the chromatic number, we will consider a graph, which is described as follows: The above graph contains some points, which are described as follows: - The same color is not used to color the two adjacent vertices.
- The minimum number of colors of this graph is 3, which is needed to properly color the vertices.
- Hence, in this graph, the chromatic number = 3
- If we want to properly color this graph, in this case, we are required at least 3 colors.
## Types of Chromatic Number of Graphs:There are various types of chromatic number of graphs, which are described as follows:
A graph will be known as a cycle graph if it contains 'n' edges and 'n' vertices (n >= 3), which form a cycle of length 'n'. There can be only 2 or 3 number of degrees of all the vertices in the cycle graph.
- The chromatic number in a cycle graph will be 2 if the number of vertices in that graph is even.
- The chromatic number in a cycle graph will be 3 if the number of vertices in that graph is odd.
There are various examples of cycle graphs. Some of them are described as follows:
Chromatic number = 3
Chromatic number = 2
Chromatic number = 2
A graph will be known as a planner graph if it is drawn in a plane. The edges of the planner graph must not cross each other.
- In a planner graph, the chromatic Number must be Less than or equal to 4.
- The planner graph can also be shown by all the above cycle graphs except example 3.
There are various examples of planer graphs. Some of them are described as follows:
Chromatic number = 3 Here, the chromatic number is less than 4, so this graph is a plane graph.
Chromatic number = 2 Here, the chromatic number is less than 4, so this graph is a plane graph.
Chromatic number = 5 Here, the chromatic number is greater than 4, so this graph is not a plane graph.
Chromatic number = 2 Here, the chromatic number is less than 4, so this graph is a plane graph.
A graph will be known as a complete graph if only one edge is used to join every two distinct vertices. Every vertex in a complete graph is connected with every other vertex. In this graph, every vertex will be colored with a different color. That means in the complete graph, two vertices do not contain the same color.
In a complete graph, the chromatic number will be equal to the number of vertices in that graph.
There are various examples of complete graphs. Some of them are described as follows:
Chromatic number = 4
Chromatic number = 5
A graph will be known as a bipartite graph if it contains two sets of vertices, A and B. The vertex of A can only join with the vertices of B. That means the edges cannot join the vertices with a set.
In any bipartite graph, the chromatic number is always equal to 2.
There are various examples of bipartite graphs. Some of them are described as follows:
Chromatic number = 2
A connected graph will be known as a tree if there are no circuits in that graph. In a tree, the chromatic number will equal to 2 no matter how many vertices are in the tree. Every bipartite graph is also a tree. Chromatic Number In any tree, the chromatic number is equal to 2.
There are various examples of a tree. Some of them are described as follows:
Chromatic number = 2
Chromatic number = 2 ## Real-life example of Chromatic NumberSuppose Marry is a manager in Xyz Company. The company hires some new employees, and she has to get a training schedule for those new employees. She has to schedule the three meetings, and she is trying to use the few time slots as much as possible for meetings. If there is an employee who has to be at two different meetings, then the manager needs to use the different time schedules for those meetings. Suppose we want to get a visual representation of this meeting. For the visual representation, Marry uses the dot to indicate the meeting. If there is an employee who has two meetings and requires to join both the meetings, then both the meeting will be connected with the help of an edge. The different time slots are represented with the help of colors. So the manager fills the dots with these colors in such a way that two dots do not contain the same color that shares an edge. (That means an employee who needs to attend the two meetings must not have the same time slot). The visual representation of this is described as follows: |