Abstract
A graph is said to be open-neighborhood conflict-free k-colorable if there exists an assignment of k different colors to some of the vertices such tha......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
