Zobrazeno 1 - 1
of 1
pro vyhledávání: '"A. Y. Harsya"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 1, Iss 1, Pp 22-30 (2016)
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 receive different colors. An $r$
Externí odkaz:
https://doaj.org/article/cd6d66d6ca5f484585965ae1346e892d
