Proper vertex colouring
maths
graph-theory
Proper vertex colouring
Given a undirected graph $G = (V,E)$ and vertex colouring $c : V \rightarrow D$. This colouring is called proper if for all $(u,v) \in E$ we have $c(u) \not = c(v)$.
Given a undirected graph $G = (V,E)$ and vertex colouring $c : V \rightarrow D$. This colouring is called proper if for all $(u,v) \in E$ we have $c(u) \not = c(v)$.