Abstract
Let G be a graph. A proper edge-coloring of G is called a strong edge-coloring if any two edges on a path of length at most three receive distinct col......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
