Nindya Laksmita, A.I. Kristiana, Dafik (2016-02-02)
Let $G$ be a simple, connected and
undirected graph. Let $r,k$ be natural number. By a proper
$k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow
S$, where $|S| = k$, such that any two adjacent vertices ...