Graph 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.
Example of Graph coloring
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.
» Applications of Graph Coloring:
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
