Abstract
The Square Colouring of a graph G refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two rec......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
