Abstract
Let G be an edge-colored connected graph, a path (trail, walk) of G is said to be a proper path (trail, walk) if any two adjacent edges of it are colo......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
