Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Samar Jakhlab"'
Publikováno v:
Open Journal of Discrete Mathematics. :185-199
A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χd(G). In this paper, we give the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c93a4069809c816f7f051998c90a8029
https://doi.org/10.4236/ojdm.2017.74017
https://doi.org/10.4236/ojdm.2017.74017
