Abstract
The k-2-distance coloring of graph G is a mapping phi : V (G) ->{1, 2, ... ,k} if any two vertices at distance at most two from each other get diff......
小提示:本篇文献需要登录阅读全文,点击跳转登录