Abstract
An n-vertex graph is sum-free if the vertices can be labelled with {1, 2, ... , n} such that no vertex gets a label which is the sum of the labels of ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
