Abstract
For a non-decreasing sequence of positive integers S = (s 1 , s 2 , ...), the S-packing chromatic number xS(G) of a graph G is the smallest integer k ......
小提示:本篇文献需要登录阅读全文,点击跳转登录