👉 In mathematics, a non-coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices have the same color. A non-coloring is called a proper coloring if it does not contain any cycle. For example, consider the following graph: ``` 1 / \ | | / \ / 2 3 ``` The non-coloring of this graph would be: ``` 1 / \ | | /
