Abstract
Jamison and Sprague defined a graph G to be a k-threshold graph with thresholds theta(1),...,theta(k) (strictly increasing) if one can assign real num......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
