Abstract
The degree anti-Ramsey numberAR(d)(H) of a graph H is the smallest integer k for which there exists a graph G with maximum degree at most k such that ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
