Abstract
A graph is d-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most d. d-orientability is a well-st......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
