Learn More

- Abdelhakim AitZai, Brahim Benmedjdoub, Mourad Boudhar
- J. Intelligent Manufacturing
- 2016

- Brahim Benmedjdoub, Éric Sopena, Isma Bouchemakh
- ArXiv
- 2016

A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number χ 2 (G) of G is then the mallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d 1 ,. .. , d k }, the integer… (More)

- ‹
- 1
- ›