Abstract
A walk Win edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study f......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
