Abstract
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 recei......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
