# Real world application of dominating set?

can anyone tell me about the application of vertex coloring problem and algorithm for vertex color problem in graph or networks.

• Please correct the question title (title is on dominating set, but the question in on coloring). Commented Feb 9, 2023 at 6:19

It is also useful in scheduling problems. Suppose that some people are attending a conference. Each person writes down a list of events they want to attend. What is the smallest number of time slots needed so that everyone can attend all sessions that they want to attend (assuming there are enough rooms)? Make a graph whose vertices are the different events, with an edge between two vertices $x$ and $y$ if there is at least one person who wants to attend events $x$ and $y$. The smallest number of events is the chromatic number of the graph.
You could think of a Sudoku puzzle as a type of colouring problem. Each of the 81 boxes in the puzzle is a vertex. Two vertices are connected by an edge if they are in the same row, column, or one of the nine $3\times 3$ subsquares. Some of the vertices have already been assigned "colours" 1 through 9. To solve the puzzle, you must colour the remaining vertices with colours 1 through 9 so that no two adjacent vertices have the same colour.